TSTP Solution File: SYO666-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SYO666-1 : TPTP v8.2.0. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n018.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 21 08:54:24 EDT 2024
% Result : Unsatisfiable 0.21s 0.52s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 10
% Syntax : Number of clauses : 52 ( 8 unt; 26 nHn; 43 RR)
% Number of literals : 319 ( 0 equ; 239 neg)
% Maximal clause size : 17 ( 6 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-1 aty)
% Number of variables : 128 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause_29,axiom,
( 'E'(s('0'),f(suc(X1)))
| 'LE'(f(X1),s('0'))
| ~ 'LE'(f(suc(X1)),s(s('0'))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_29) ).
cnf(clause_185,axiom,
( 'E'(s('0'),f(X1))
| 'LE'(f(X1),s('0'))
| ~ 'LE'(f(X1),s(s('0'))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_185) ).
cnf(clause_179,axiom,
( ~ 'E'(s('0'),f(X1))
| ~ iLEQ(suc(X2),suc(X3))
| ~ 'E'(s('0'),f(X4))
| ~ 'E'(s('0'),f(suc(X4)))
| ~ iLEQ(suc(X5),suc(X2))
| ~ 'E'(s('0'),f(X2))
| ~ 'E'(s('0'),f(suc(X2)))
| ~ iLEQ(suc(X1),suc(X5))
| ~ 'E'(s('0'),f(suc(X1)))
| ~ iLEQ(suc(X3),suc(X6))
| ~ 'E'(s('0'),f(suc(X5)))
| ~ 'E'(s('0'),f(X6))
| ~ 'E'(s('0'),f(suc(X3)))
| ~ iLEQ(suc(X4),suc(X1))
| ~ 'E'(s('0'),f(X5))
| ~ 'E'(s('0'),f(X3))
| ~ 'E'(s('0'),f(suc(X6))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_179) ).
cnf(clause_83,axiom,
'LE'(f(X1),s(s('0'))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_83) ).
cnf(clause_70,axiom,
( iLEQ(suc(X1),suc(X1))
| ~ 'E'(s('0'),f(X1))
| ~ 'E'(s('0'),f(suc(X1))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_70) ).
cnf(clause_102,axiom,
( ~ iLEQ(suc(X1),suc(X2))
| ~ 'E'('0',f(suc(X3)))
| ~ 'E'('0',f(suc(X1)))
| ~ iLEQ(suc(X2),suc(X4))
| ~ 'E'('0',f(suc(X2)))
| ~ 'E'('0',f(X3))
| ~ 'E'('0',f(suc(X5)))
| ~ 'E'('0',f(X2))
| ~ iLEQ(suc(X6),suc(X1))
| ~ 'E'('0',f(X1))
| ~ iLEQ(suc(X5),suc(X6))
| ~ 'E'('0',f(suc(X4)))
| ~ 'E'('0',f(X5))
| ~ iLEQ(suc(X3),suc(X5))
| ~ 'E'('0',f(suc(X6)))
| ~ 'E'('0',f(X4))
| ~ 'E'('0',f(X6)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_102) ).
cnf(clause_12,axiom,
( iLEQ(suc(X1),suc(X1))
| ~ 'E'('0',f(X1))
| ~ 'E'('0',f(suc(X1))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_12) ).
cnf(clause_123,axiom,
( 'E'('0',f(suc(X1)))
| 'LE'(f(X1),'0')
| ~ 'LE'(f(suc(X1)),s('0')) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_123) ).
cnf(clause_42,axiom,
( 'E'('0',f(X1))
| 'LE'(f(X1),'0')
| ~ 'LE'(f(X1),s('0')) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_42) ).
cnf(clause_98,axiom,
~ 'LE'(f(z),'0'),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_98) ).
cnf(c_0_10,plain,
( 'E'(s('0'),f(suc(X1)))
| 'LE'(f(X1),s('0'))
| ~ 'LE'(f(suc(X1)),s(s('0'))) ),
inference(fof_simplification,[status(thm)],[clause_29]) ).
cnf(c_0_11,plain,
( 'E'(s('0'),f(X1))
| 'LE'(f(X1),s('0'))
| ~ 'LE'(f(X1),s(s('0'))) ),
inference(fof_simplification,[status(thm)],[clause_185]) ).
cnf(c_0_12,plain,
( ~ 'E'(s('0'),f(X1))
| ~ iLEQ(suc(X2),suc(X3))
| ~ 'E'(s('0'),f(X4))
| ~ 'E'(s('0'),f(suc(X4)))
| ~ iLEQ(suc(X5),suc(X2))
| ~ 'E'(s('0'),f(X2))
| ~ 'E'(s('0'),f(suc(X2)))
| ~ iLEQ(suc(X1),suc(X5))
| ~ 'E'(s('0'),f(suc(X1)))
| ~ iLEQ(suc(X3),suc(X6))
| ~ 'E'(s('0'),f(suc(X5)))
| ~ 'E'(s('0'),f(X6))
| ~ 'E'(s('0'),f(suc(X3)))
| ~ iLEQ(suc(X4),suc(X1))
| ~ 'E'(s('0'),f(X5))
| ~ 'E'(s('0'),f(X3))
| ~ 'E'(s('0'),f(suc(X6))) ),
inference(fof_simplification,[status(thm)],[clause_179]) ).
cnf(c_0_13,plain,
( 'E'(s('0'),f(suc(X1)))
| 'LE'(f(X1),s('0'))
| ~ 'LE'(f(suc(X1)),s(s('0'))) ),
c_0_10 ).
cnf(c_0_14,axiom,
'LE'(f(X1),s(s('0'))),
clause_83 ).
cnf(c_0_15,plain,
( 'E'(s('0'),f(X1))
| 'LE'(f(X1),s('0'))
| ~ 'LE'(f(X1),s(s('0'))) ),
c_0_11 ).
cnf(c_0_16,plain,
( ~ 'E'(s('0'),f(X1))
| ~ iLEQ(suc(X2),suc(X3))
| ~ 'E'(s('0'),f(X4))
| ~ 'E'(s('0'),f(suc(X4)))
| ~ iLEQ(suc(X5),suc(X2))
| ~ 'E'(s('0'),f(X2))
| ~ 'E'(s('0'),f(suc(X2)))
| ~ iLEQ(suc(X1),suc(X5))
| ~ 'E'(s('0'),f(suc(X1)))
| ~ iLEQ(suc(X3),suc(X6))
| ~ 'E'(s('0'),f(suc(X5)))
| ~ 'E'(s('0'),f(X6))
| ~ 'E'(s('0'),f(suc(X3)))
| ~ iLEQ(suc(X4),suc(X1))
| ~ 'E'(s('0'),f(X5))
| ~ 'E'(s('0'),f(X3))
| ~ 'E'(s('0'),f(suc(X6))) ),
c_0_12 ).
cnf(c_0_17,plain,
( 'LE'(f(X1),s('0'))
| 'E'(s('0'),f(suc(X1))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14])]) ).
cnf(c_0_18,plain,
( 'LE'(f(X1),s('0'))
| 'E'(s('0'),f(X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_14])]) ).
cnf(c_0_19,plain,
( 'LE'(f(X1),s('0'))
| ~ 'E'(s('0'),f(suc(X2)))
| ~ 'E'(s('0'),f(suc(X3)))
| ~ 'E'(s('0'),f(suc(X4)))
| ~ 'E'(s('0'),f(suc(X5)))
| ~ 'E'(s('0'),f(suc(X6)))
| ~ 'E'(s('0'),f(X2))
| ~ 'E'(s('0'),f(X3))
| ~ 'E'(s('0'),f(X4))
| ~ 'E'(s('0'),f(X5))
| ~ 'E'(s('0'),f(X6))
| ~ iLEQ(suc(X2),suc(X5))
| ~ iLEQ(suc(X3),suc(X6))
| ~ iLEQ(suc(X4),suc(X1))
| ~ iLEQ(suc(X5),suc(X4))
| ~ iLEQ(suc(X6),suc(X2)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]) ).
cnf(c_0_20,plain,
( 'LE'(f(X1),s('0'))
| 'LE'(f(X2),s('0'))
| ~ 'E'(s('0'),f(suc(X3)))
| ~ 'E'(s('0'),f(suc(X4)))
| ~ 'E'(s('0'),f(suc(X5)))
| ~ 'E'(s('0'),f(suc(X6)))
| ~ 'E'(s('0'),f(X3))
| ~ 'E'(s('0'),f(X4))
| ~ 'E'(s('0'),f(X5))
| ~ 'E'(s('0'),f(X6))
| ~ iLEQ(suc(X1),suc(X5))
| ~ iLEQ(suc(X3),suc(X6))
| ~ iLEQ(suc(X4),suc(X2))
| ~ iLEQ(suc(X5),suc(X4))
| ~ iLEQ(suc(X6),suc(X1)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_17]),c_0_18]) ).
cnf(c_0_21,plain,
( 'LE'(f(X1),s('0'))
| 'LE'(f(X2),s('0'))
| 'LE'(f(X3),s('0'))
| ~ 'E'(s('0'),f(suc(X4)))
| ~ 'E'(s('0'),f(suc(X5)))
| ~ 'E'(s('0'),f(suc(X6)))
| ~ 'E'(s('0'),f(X4))
| ~ 'E'(s('0'),f(X5))
| ~ 'E'(s('0'),f(X6))
| ~ iLEQ(suc(X3),suc(X5))
| ~ iLEQ(suc(X1),suc(X6))
| ~ iLEQ(suc(X4),suc(X2))
| ~ iLEQ(suc(X5),suc(X4))
| ~ iLEQ(suc(X6),suc(X3)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_17]),c_0_18]) ).
cnf(c_0_22,plain,
( 'LE'(f(X1),s('0'))
| 'LE'(f(X2),s('0'))
| 'LE'(f(X3),s('0'))
| 'LE'(f(X4),s('0'))
| ~ 'E'(s('0'),f(suc(X5)))
| ~ 'E'(s('0'),f(suc(X6)))
| ~ 'E'(s('0'),f(X5))
| ~ 'E'(s('0'),f(X6))
| ~ iLEQ(suc(X2),suc(X5))
| ~ iLEQ(suc(X4),suc(X6))
| ~ iLEQ(suc(X1),suc(X3))
| ~ iLEQ(suc(X5),suc(X1))
| ~ iLEQ(suc(X6),suc(X2)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_17]),c_0_18]) ).
cnf(c_0_23,plain,
( iLEQ(suc(X1),suc(X1))
| ~ 'E'(s('0'),f(X1))
| ~ 'E'(s('0'),f(suc(X1))) ),
inference(fof_simplification,[status(thm)],[clause_70]) ).
cnf(c_0_24,plain,
( 'LE'(f(X1),s('0'))
| 'LE'(f(X2),s('0'))
| 'LE'(f(X3),s('0'))
| 'LE'(f(X4),s('0'))
| 'LE'(f(X5),s('0'))
| ~ 'E'(s('0'),f(suc(X6)))
| ~ 'E'(s('0'),f(X6))
| ~ iLEQ(suc(X4),suc(X1))
| ~ iLEQ(suc(X2),suc(X6))
| ~ iLEQ(suc(X5),suc(X3))
| ~ iLEQ(suc(X1),suc(X5))
| ~ iLEQ(suc(X6),suc(X4)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_17]),c_0_18]) ).
cnf(c_0_25,plain,
( iLEQ(suc(X1),suc(X1))
| ~ 'E'(s('0'),f(X1))
| ~ 'E'(s('0'),f(suc(X1))) ),
c_0_23 ).
cnf(c_0_26,plain,
( ~ iLEQ(suc(X1),suc(X2))
| ~ 'E'('0',f(suc(X3)))
| ~ 'E'('0',f(suc(X1)))
| ~ iLEQ(suc(X2),suc(X4))
| ~ 'E'('0',f(suc(X2)))
| ~ 'E'('0',f(X3))
| ~ 'E'('0',f(suc(X5)))
| ~ 'E'('0',f(X2))
| ~ iLEQ(suc(X6),suc(X1))
| ~ 'E'('0',f(X1))
| ~ iLEQ(suc(X5),suc(X6))
| ~ 'E'('0',f(suc(X4)))
| ~ 'E'('0',f(X5))
| ~ iLEQ(suc(X3),suc(X5))
| ~ 'E'('0',f(suc(X6)))
| ~ 'E'('0',f(X4))
| ~ 'E'('0',f(X6)) ),
inference(fof_simplification,[status(thm)],[clause_102]) ).
cnf(c_0_27,plain,
( iLEQ(suc(X1),suc(X1))
| ~ 'E'('0',f(X1))
| ~ 'E'('0',f(suc(X1))) ),
inference(fof_simplification,[status(thm)],[clause_12]) ).
cnf(c_0_28,plain,
( 'LE'(f(X1),s('0'))
| 'LE'(f(X2),s('0'))
| 'LE'(f(X3),s('0'))
| 'LE'(f(X4),s('0'))
| 'LE'(f(X5),s('0'))
| 'LE'(f(X6),s('0'))
| ~ iLEQ(suc(X3),suc(X6))
| ~ iLEQ(suc(X5),suc(X1))
| ~ iLEQ(suc(X2),suc(X4))
| ~ iLEQ(suc(X6),suc(X2))
| ~ iLEQ(suc(X1),suc(X3)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_17]),c_0_18]) ).
cnf(c_0_29,plain,
( 'LE'(f(X1),s('0'))
| iLEQ(suc(X1),suc(X1)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_17]),c_0_18]) ).
cnf(c_0_30,plain,
( ~ iLEQ(suc(X1),suc(X2))
| ~ 'E'('0',f(suc(X3)))
| ~ 'E'('0',f(suc(X1)))
| ~ iLEQ(suc(X2),suc(X4))
| ~ 'E'('0',f(suc(X2)))
| ~ 'E'('0',f(X3))
| ~ 'E'('0',f(suc(X5)))
| ~ 'E'('0',f(X2))
| ~ iLEQ(suc(X6),suc(X1))
| ~ 'E'('0',f(X1))
| ~ iLEQ(suc(X5),suc(X6))
| ~ 'E'('0',f(suc(X4)))
| ~ 'E'('0',f(X5))
| ~ iLEQ(suc(X3),suc(X5))
| ~ 'E'('0',f(suc(X6)))
| ~ 'E'('0',f(X4))
| ~ 'E'('0',f(X6)) ),
c_0_26 ).
cnf(c_0_31,plain,
( iLEQ(suc(X1),suc(X1))
| ~ 'E'('0',f(X1))
| ~ 'E'('0',f(suc(X1))) ),
c_0_27 ).
cnf(c_0_32,plain,
( 'LE'(f(X1),s('0'))
| 'LE'(f(X2),s('0'))
| 'LE'(f(X3),s('0'))
| 'LE'(f(X4),s('0'))
| 'LE'(f(X5),s('0'))
| ~ iLEQ(suc(X1),suc(X5))
| ~ iLEQ(suc(X4),suc(X2))
| ~ iLEQ(suc(X3),suc(X4))
| ~ iLEQ(suc(X5),suc(X3)) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_33,plain,
( ~ 'E'('0',f(suc(X1)))
| ~ 'E'('0',f(suc(X2)))
| ~ 'E'('0',f(suc(X3)))
| ~ 'E'('0',f(suc(X4)))
| ~ 'E'('0',f(suc(X5)))
| ~ 'E'('0',f(X1))
| ~ 'E'('0',f(X2))
| ~ 'E'('0',f(X3))
| ~ 'E'('0',f(X4))
| ~ 'E'('0',f(X5))
| ~ iLEQ(suc(X2),suc(X1))
| ~ iLEQ(suc(X4),suc(X2))
| ~ iLEQ(suc(X5),suc(X3))
| ~ iLEQ(suc(X1),suc(X5)) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_34,plain,
( 'LE'(f(X1),s('0'))
| 'LE'(f(X2),s('0'))
| 'LE'(f(X3),s('0'))
| 'LE'(f(X4),s('0'))
| ~ iLEQ(suc(X1),suc(X3))
| ~ iLEQ(suc(X2),suc(X1))
| ~ iLEQ(suc(X4),suc(X2)) ),
inference(spm,[status(thm)],[c_0_32,c_0_29]) ).
cnf(c_0_35,plain,
( ~ 'E'('0',f(suc(X1)))
| ~ 'E'('0',f(suc(X2)))
| ~ 'E'('0',f(suc(X3)))
| ~ 'E'('0',f(suc(X4)))
| ~ 'E'('0',f(X1))
| ~ 'E'('0',f(X2))
| ~ 'E'('0',f(X3))
| ~ 'E'('0',f(X4))
| ~ iLEQ(suc(X3),suc(X1))
| ~ iLEQ(suc(X4),suc(X2))
| ~ iLEQ(suc(X1),suc(X4)) ),
inference(spm,[status(thm)],[c_0_33,c_0_31]) ).
cnf(c_0_36,plain,
( 'LE'(f(X1),s('0'))
| 'LE'(f(X2),s('0'))
| 'LE'(f(X3),s('0'))
| ~ iLEQ(suc(X2),suc(X3))
| ~ iLEQ(suc(X1),suc(X2)) ),
inference(spm,[status(thm)],[c_0_34,c_0_29]) ).
cnf(c_0_37,plain,
( ~ 'E'('0',f(suc(X1)))
| ~ 'E'('0',f(suc(X2)))
| ~ 'E'('0',f(suc(X3)))
| ~ 'E'('0',f(X1))
| ~ 'E'('0',f(X2))
| ~ 'E'('0',f(X3))
| ~ iLEQ(suc(X3),suc(X2))
| ~ iLEQ(suc(X1),suc(X3)) ),
inference(spm,[status(thm)],[c_0_35,c_0_31]) ).
cnf(c_0_38,plain,
( 'E'('0',f(suc(X1)))
| 'LE'(f(X1),'0')
| ~ 'LE'(f(suc(X1)),s('0')) ),
inference(fof_simplification,[status(thm)],[clause_123]) ).
cnf(c_0_39,plain,
( 'LE'(f(X1),s('0'))
| 'LE'(f(X2),s('0'))
| ~ iLEQ(suc(X2),suc(X1)) ),
inference(spm,[status(thm)],[c_0_36,c_0_29]) ).
cnf(c_0_40,plain,
( 'E'('0',f(X1))
| 'LE'(f(X1),'0')
| ~ 'LE'(f(X1),s('0')) ),
inference(fof_simplification,[status(thm)],[clause_42]) ).
cnf(c_0_41,plain,
( ~ 'E'('0',f(suc(X1)))
| ~ 'E'('0',f(suc(X2)))
| ~ 'E'('0',f(X1))
| ~ 'E'('0',f(X2))
| ~ iLEQ(suc(X1),suc(X2)) ),
inference(spm,[status(thm)],[c_0_37,c_0_31]) ).
cnf(c_0_42,plain,
( 'E'('0',f(suc(X1)))
| 'LE'(f(X1),'0')
| ~ 'LE'(f(suc(X1)),s('0')) ),
c_0_38 ).
cnf(c_0_43,plain,
'LE'(f(X1),s('0')),
inference(spm,[status(thm)],[c_0_39,c_0_29]) ).
cnf(c_0_44,plain,
( 'E'('0',f(X1))
| 'LE'(f(X1),'0')
| ~ 'LE'(f(X1),s('0')) ),
c_0_40 ).
cnf(c_0_45,plain,
~ 'LE'(f(z),'0'),
inference(fof_simplification,[status(thm)],[clause_98]) ).
cnf(c_0_46,plain,
( ~ 'E'('0',f(suc(X1)))
| ~ 'E'('0',f(X1)) ),
inference(spm,[status(thm)],[c_0_41,c_0_31]) ).
cnf(c_0_47,plain,
( 'LE'(f(X1),'0')
| 'E'('0',f(suc(X1))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_43])]) ).
cnf(c_0_48,plain,
( 'LE'(f(X1),'0')
| 'E'('0',f(X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_44,c_0_43])]) ).
cnf(c_0_49,plain,
~ 'LE'(f(z),'0'),
c_0_45 ).
cnf(c_0_50,plain,
'LE'(f(X1),'0'),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_48]) ).
cnf(c_0_51,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_49,c_0_50])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SYO666-1 : TPTP v8.2.0. Released v7.3.0.
% 0.04/0.14 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n018.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Mon May 20 10:44:23 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.21/0.50 Running first-order model finding
% 0.21/0.50 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.52 # Version: 3.1.0
% 0.21/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.52 # Starting sh5l with 300s (1) cores
% 0.21/0.52 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 21684 completed with status 0
% 0.21/0.52 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.21/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.52 # No SInE strategy applied
% 0.21/0.52 # Search class: FGHNF-FFMF11-SFFFFFNN
% 0.21/0.52 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.52 # Starting G-E--_208_C47_F1_SE_CS_SP_PS_S0Y with 811s (1) cores
% 0.21/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.21/0.52 # Starting G-E--_208_C02CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.21/0.52 # Starting G-N--_023_B07_F1_SP_PI_Q7_CS_SP_CO_S5PRR_S0Y with 136s (1) cores
% 0.21/0.52 # Starting new_bool_3 with 136s (1) cores
% 0.21/0.52 # G-E--_208_C47_F1_SE_CS_SP_PS_S0Y with pid 21691 completed with status 0
% 0.21/0.52 # Result found by G-E--_208_C47_F1_SE_CS_SP_PS_S0Y
% 0.21/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.52 # No SInE strategy applied
% 0.21/0.52 # Search class: FGHNF-FFMF11-SFFFFFNN
% 0.21/0.52 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.52 # Starting G-E--_208_C47_F1_SE_CS_SP_PS_S0Y with 811s (1) cores
% 0.21/0.52 # Preprocessing time : 0.001 s
% 0.21/0.52 # Presaturation interreduction done
% 0.21/0.52
% 0.21/0.52 # Proof found!
% 0.21/0.52 # SZS status Unsatisfiable
% 0.21/0.52 # SZS output start CNFRefutation
% See solution above
% 0.21/0.52 # Parsed axioms : 10
% 0.21/0.52 # Removed by relevancy pruning/SinE : 0
% 0.21/0.52 # Initial clauses : 10
% 0.21/0.52 # Removed in clause preprocessing : 0
% 0.21/0.52 # Initial clauses in saturation : 10
% 0.21/0.52 # Processed clauses : 45
% 0.21/0.52 # ...of these trivial : 0
% 0.21/0.52 # ...subsumed : 1
% 0.21/0.52 # ...remaining for further processing : 44
% 0.21/0.52 # Other redundant clauses eliminated : 0
% 0.21/0.52 # Clauses deleted for lack of memory : 0
% 0.21/0.52 # Backward-subsumed : 12
% 0.21/0.52 # Backward-rewritten : 16
% 0.21/0.52 # Generated clauses : 35
% 0.21/0.52 # ...of the previous two non-redundant : 37
% 0.21/0.52 # ...aggressively subsumed : 0
% 0.21/0.52 # Contextual simplify-reflections : 8
% 0.21/0.52 # Paramodulations : 35
% 0.21/0.52 # Factorizations : 0
% 0.21/0.52 # NegExts : 0
% 0.21/0.52 # Equation resolutions : 0
% 0.21/0.52 # Disequality decompositions : 0
% 0.21/0.52 # Total rewrite steps : 23
% 0.21/0.52 # ...of those cached : 13
% 0.21/0.52 # Propositional unsat checks : 0
% 0.21/0.52 # Propositional check models : 0
% 0.21/0.52 # Propositional check unsatisfiable : 0
% 0.21/0.52 # Propositional clauses : 0
% 0.21/0.52 # Propositional clauses after purity: 0
% 0.21/0.52 # Propositional unsat core size : 0
% 0.21/0.52 # Propositional preprocessing time : 0.000
% 0.21/0.52 # Propositional encoding time : 0.000
% 0.21/0.52 # Propositional solver time : 0.000
% 0.21/0.52 # Success case prop preproc time : 0.000
% 0.21/0.52 # Success case prop encoding time : 0.000
% 0.21/0.52 # Success case prop solver time : 0.000
% 0.21/0.52 # Current number of processed clauses : 6
% 0.21/0.52 # Positive orientable unit clauses : 3
% 0.21/0.52 # Positive unorientable unit clauses: 0
% 0.21/0.52 # Negative unit clauses : 0
% 0.21/0.52 # Non-unit-clauses : 3
% 0.21/0.52 # Current number of unprocessed clauses: 12
% 0.21/0.52 # ...number of literals in the above : 139
% 0.21/0.52 # Current number of archived formulas : 0
% 0.21/0.52 # Current number of archived clauses : 38
% 0.21/0.52 # Clause-clause subsumption calls (NU) : 359
% 0.21/0.52 # Rec. Clause-clause subsumption calls : 111
% 0.21/0.52 # Non-unit clause-clause subsumptions : 21
% 0.21/0.52 # Unit Clause-clause subsumption calls : 0
% 0.21/0.52 # Rewrite failures with RHS unbound : 0
% 0.21/0.52 # BW rewrite match attempts : 8
% 0.21/0.52 # BW rewrite match successes : 8
% 0.21/0.52 # Condensation attempts : 0
% 0.21/0.52 # Condensation successes : 0
% 0.21/0.52 # Termbank termtop insertions : 4552
% 0.21/0.52 # Search garbage collected termcells : 112
% 0.21/0.52
% 0.21/0.52 # -------------------------------------------------
% 0.21/0.52 # User time : 0.011 s
% 0.21/0.52 # System time : 0.003 s
% 0.21/0.52 # Total time : 0.014 s
% 0.21/0.52 # Maximum resident set size: 1640 pages
% 0.21/0.52
% 0.21/0.52 # -------------------------------------------------
% 0.21/0.52 # User time : 0.055 s
% 0.21/0.52 # System time : 0.009 s
% 0.21/0.52 # Total time : 0.064 s
% 0.21/0.52 # Maximum resident set size: 1704 pages
% 0.21/0.52 % E---3.1 exiting
%------------------------------------------------------------------------------