TSTP Solution File: SYO680-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SYO680-1 : TPTP v8.1.2. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n011.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 20:50:36 EDT 2023
% Result : Unsatisfiable 0.23s 0.54s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 26
% Number of leaves : 18
% Syntax : Number of clauses : 65 ( 9 unt; 36 nHn; 51 RR)
% Number of literals : 245 ( 0 equ; 150 neg)
% Maximal clause size : 8 ( 3 avg)
% Maximal term depth : 5 ( 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 : 106 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause_102,axiom,
( 'E'(s(s(s('0'))),f(suc(X1)))
| 'LE'(f(X1),s(s(s('0'))))
| ~ 'LE'(f(suc(X1)),s(s(s(s('0'))))) ),
file('/export/starexec/sandbox/tmp/tmp.jK2cNcaM4K/E---3.1_32041.p',clause_102) ).
cnf(clause_104,axiom,
'LE'(f(X1),s(s(s(s('0'))))),
file('/export/starexec/sandbox/tmp/tmp.jK2cNcaM4K/E---3.1_32041.p',clause_104) ).
cnf(clause_127,axiom,
( 'E'(s(s(s('0'))),f(X1))
| 'LE'(f(X1),s(s(s('0'))))
| ~ 'LE'(f(X1),s(s(s(s('0'))))) ),
file('/export/starexec/sandbox/tmp/tmp.jK2cNcaM4K/E---3.1_32041.p',clause_127) ).
cnf(clause_71,axiom,
( ~ iLEQ(suc(X1),suc(X2))
| ~ 'E'(s(s(s('0'))),f(X2))
| ~ 'E'(s(s(s('0'))),f(X1))
| ~ iLEQ(suc(X3),suc(X1))
| ~ 'E'(s(s(s('0'))),f(X3))
| ~ 'E'(s(s(s('0'))),f(suc(X1)))
| ~ 'E'(s(s(s('0'))),f(suc(X2)))
| ~ 'E'(s(s(s('0'))),f(suc(X3))) ),
file('/export/starexec/sandbox/tmp/tmp.jK2cNcaM4K/E---3.1_32041.p',clause_71) ).
cnf(clause_14,axiom,
( iLEQ(suc(X1),suc(X1))
| ~ 'E'(s(s(s('0'))),f(X1))
| ~ 'E'(s(s(s('0'))),f(suc(X1))) ),
file('/export/starexec/sandbox/tmp/tmp.jK2cNcaM4K/E---3.1_32041.p',clause_14) ).
cnf(clause_84,axiom,
( 'E'(s(s('0')),f(suc(X1)))
| 'LE'(f(X1),s(s('0')))
| ~ 'LE'(f(suc(X1)),s(s(s('0')))) ),
file('/export/starexec/sandbox/tmp/tmp.jK2cNcaM4K/E---3.1_32041.p',clause_84) ).
cnf(clause_51,axiom,
( 'E'(s(s('0')),f(X1))
| 'LE'(f(X1),s(s('0')))
| ~ 'LE'(f(X1),s(s(s('0')))) ),
file('/export/starexec/sandbox/tmp/tmp.jK2cNcaM4K/E---3.1_32041.p',clause_51) ).
cnf(clause_20,axiom,
( ~ 'E'(s(s('0')),f(suc(X1)))
| ~ 'E'(s(s('0')),f(X1))
| ~ iLEQ(suc(X1),suc(X2))
| ~ 'E'(s(s('0')),f(suc(X3)))
| ~ 'E'(s(s('0')),f(suc(X2)))
| ~ iLEQ(suc(X3),suc(X1))
| ~ 'E'(s(s('0')),f(X2))
| ~ 'E'(s(s('0')),f(X3)) ),
file('/export/starexec/sandbox/tmp/tmp.jK2cNcaM4K/E---3.1_32041.p',clause_20) ).
cnf(clause_5,axiom,
( iLEQ(suc(X1),suc(X1))
| ~ 'E'(s(s('0')),f(X1))
| ~ 'E'(s(s('0')),f(suc(X1))) ),
file('/export/starexec/sandbox/tmp/tmp.jK2cNcaM4K/E---3.1_32041.p',clause_5) ).
cnf(clause_15,axiom,
( 'E'(s('0'),f(suc(X1)))
| 'LE'(f(X1),s('0'))
| ~ 'LE'(f(suc(X1)),s(s('0'))) ),
file('/export/starexec/sandbox/tmp/tmp.jK2cNcaM4K/E---3.1_32041.p',clause_15) ).
cnf(clause_6,axiom,
( 'E'(s('0'),f(X1))
| 'LE'(f(X1),s('0'))
| ~ 'LE'(f(X1),s(s('0'))) ),
file('/export/starexec/sandbox/tmp/tmp.jK2cNcaM4K/E---3.1_32041.p',clause_6) ).
cnf(clause_21,axiom,
( ~ iLEQ(suc(X1),suc(X2))
| ~ 'E'(s('0'),f(suc(X3)))
| ~ iLEQ(suc(X3),suc(X1))
| ~ 'E'(s('0'),f(suc(X2)))
| ~ 'E'(s('0'),f(X3))
| ~ 'E'(s('0'),f(X2))
| ~ 'E'(s('0'),f(suc(X1)))
| ~ 'E'(s('0'),f(X1)) ),
file('/export/starexec/sandbox/tmp/tmp.jK2cNcaM4K/E---3.1_32041.p',clause_21) ).
cnf(clause_91,axiom,
( iLEQ(suc(X1),suc(X1))
| ~ 'E'(s('0'),f(X1))
| ~ 'E'(s('0'),f(suc(X1))) ),
file('/export/starexec/sandbox/tmp/tmp.jK2cNcaM4K/E---3.1_32041.p',clause_91) ).
cnf(clause_114,axiom,
( 'E'('0',f(suc(X1)))
| 'LE'(f(X1),'0')
| ~ 'LE'(f(suc(X1)),s('0')) ),
file('/export/starexec/sandbox/tmp/tmp.jK2cNcaM4K/E---3.1_32041.p',clause_114) ).
cnf(clause_96,axiom,
( 'E'('0',f(X1))
| 'LE'(f(X1),'0')
| ~ 'LE'(f(X1),s('0')) ),
file('/export/starexec/sandbox/tmp/tmp.jK2cNcaM4K/E---3.1_32041.p',clause_96) ).
cnf(clause_144,axiom,
( ~ 'E'('0',f(suc(X1)))
| ~ iLEQ(suc(X1),suc(X2))
| ~ iLEQ(suc(X3),suc(X1))
| ~ 'E'('0',f(suc(X2)))
| ~ 'E'('0',f(X1))
| ~ 'E'('0',f(suc(X3)))
| ~ 'E'('0',f(X2))
| ~ 'E'('0',f(X3)) ),
file('/export/starexec/sandbox/tmp/tmp.jK2cNcaM4K/E---3.1_32041.p',clause_144) ).
cnf(clause_109,axiom,
( iLEQ(suc(X1),suc(X1))
| ~ 'E'('0',f(X1))
| ~ 'E'('0',f(suc(X1))) ),
file('/export/starexec/sandbox/tmp/tmp.jK2cNcaM4K/E---3.1_32041.p',clause_109) ).
cnf(clause_66,axiom,
~ 'LE'(f(z),'0'),
file('/export/starexec/sandbox/tmp/tmp.jK2cNcaM4K/E---3.1_32041.p',clause_66) ).
cnf(c_0_18,axiom,
( 'E'(s(s(s('0'))),f(suc(X1)))
| 'LE'(f(X1),s(s(s('0'))))
| ~ 'LE'(f(suc(X1)),s(s(s(s('0'))))) ),
clause_102 ).
cnf(c_0_19,axiom,
'LE'(f(X1),s(s(s(s('0'))))),
clause_104 ).
cnf(c_0_20,axiom,
( 'E'(s(s(s('0'))),f(X1))
| 'LE'(f(X1),s(s(s('0'))))
| ~ 'LE'(f(X1),s(s(s(s('0'))))) ),
clause_127 ).
cnf(c_0_21,axiom,
( ~ iLEQ(suc(X1),suc(X2))
| ~ 'E'(s(s(s('0'))),f(X2))
| ~ 'E'(s(s(s('0'))),f(X1))
| ~ iLEQ(suc(X3),suc(X1))
| ~ 'E'(s(s(s('0'))),f(X3))
| ~ 'E'(s(s(s('0'))),f(suc(X1)))
| ~ 'E'(s(s(s('0'))),f(suc(X2)))
| ~ 'E'(s(s(s('0'))),f(suc(X3))) ),
clause_71 ).
cnf(c_0_22,plain,
( 'LE'(f(X1),s(s(s('0'))))
| 'E'(s(s(s('0'))),f(suc(X1))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_19])]) ).
cnf(c_0_23,plain,
( 'LE'(f(X1),s(s(s('0'))))
| 'E'(s(s(s('0'))),f(X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_19])]) ).
cnf(c_0_24,plain,
( 'LE'(f(X1),s(s(s('0'))))
| ~ iLEQ(suc(X1),suc(X2))
| ~ iLEQ(suc(X2),suc(X3))
| ~ 'E'(s(s(s('0'))),f(suc(X3)))
| ~ 'E'(s(s(s('0'))),f(suc(X2)))
| ~ 'E'(s(s(s('0'))),f(X3))
| ~ 'E'(s(s(s('0'))),f(X2)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]) ).
cnf(c_0_25,plain,
( 'LE'(f(X1),s(s(s('0'))))
| 'LE'(f(X2),s(s(s('0'))))
| ~ iLEQ(suc(X2),suc(X3))
| ~ iLEQ(suc(X3),suc(X1))
| ~ 'E'(s(s(s('0'))),f(suc(X3)))
| ~ 'E'(s(s(s('0'))),f(X3)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_22]),c_0_23]) ).
cnf(c_0_26,plain,
( 'LE'(f(X1),s(s(s('0'))))
| 'LE'(f(X2),s(s(s('0'))))
| 'LE'(f(X3),s(s(s('0'))))
| ~ iLEQ(suc(X2),suc(X1))
| ~ iLEQ(suc(X1),suc(X3)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_22]),c_0_23]) ).
cnf(c_0_27,axiom,
( iLEQ(suc(X1),suc(X1))
| ~ 'E'(s(s(s('0'))),f(X1))
| ~ 'E'(s(s(s('0'))),f(suc(X1))) ),
clause_14 ).
cnf(c_0_28,plain,
( 'LE'(f(X1),s(s(s('0'))))
| 'LE'(f(X2),s(s(s('0'))))
| ~ iLEQ(suc(X2),suc(X1)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_23]),c_0_22]) ).
cnf(c_0_29,axiom,
( 'E'(s(s('0')),f(suc(X1)))
| 'LE'(f(X1),s(s('0')))
| ~ 'LE'(f(suc(X1)),s(s(s('0')))) ),
clause_84 ).
cnf(c_0_30,plain,
'LE'(f(X1),s(s(s('0')))),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_27]),c_0_23]),c_0_22]) ).
cnf(c_0_31,axiom,
( 'E'(s(s('0')),f(X1))
| 'LE'(f(X1),s(s('0')))
| ~ 'LE'(f(X1),s(s(s('0')))) ),
clause_51 ).
cnf(c_0_32,axiom,
( ~ 'E'(s(s('0')),f(suc(X1)))
| ~ 'E'(s(s('0')),f(X1))
| ~ iLEQ(suc(X1),suc(X2))
| ~ 'E'(s(s('0')),f(suc(X3)))
| ~ 'E'(s(s('0')),f(suc(X2)))
| ~ iLEQ(suc(X3),suc(X1))
| ~ 'E'(s(s('0')),f(X2))
| ~ 'E'(s(s('0')),f(X3)) ),
clause_20 ).
cnf(c_0_33,plain,
( 'LE'(f(X1),s(s('0')))
| 'E'(s(s('0')),f(suc(X1))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_30])]) ).
cnf(c_0_34,plain,
( 'LE'(f(X1),s(s('0')))
| 'E'(s(s('0')),f(X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_30])]) ).
cnf(c_0_35,plain,
( 'LE'(f(X1),s(s('0')))
| ~ iLEQ(suc(X1),suc(X2))
| ~ iLEQ(suc(X2),suc(X3))
| ~ 'E'(s(s('0')),f(suc(X3)))
| ~ 'E'(s(s('0')),f(suc(X2)))
| ~ 'E'(s(s('0')),f(X3))
| ~ 'E'(s(s('0')),f(X2)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]) ).
cnf(c_0_36,plain,
( 'LE'(f(X1),s(s('0')))
| 'LE'(f(X2),s(s('0')))
| ~ iLEQ(suc(X2),suc(X3))
| ~ iLEQ(suc(X3),suc(X1))
| ~ 'E'(s(s('0')),f(suc(X3)))
| ~ 'E'(s(s('0')),f(X3)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_33]),c_0_34]) ).
cnf(c_0_37,plain,
( 'LE'(f(X1),s(s('0')))
| 'LE'(f(X2),s(s('0')))
| 'LE'(f(X3),s(s('0')))
| ~ iLEQ(suc(X2),suc(X1))
| ~ iLEQ(suc(X1),suc(X3)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_33]),c_0_34]) ).
cnf(c_0_38,axiom,
( iLEQ(suc(X1),suc(X1))
| ~ 'E'(s(s('0')),f(X1))
| ~ 'E'(s(s('0')),f(suc(X1))) ),
clause_5 ).
cnf(c_0_39,plain,
( 'LE'(f(X1),s(s('0')))
| 'LE'(f(X2),s(s('0')))
| ~ iLEQ(suc(X2),suc(X1)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_34]),c_0_33]) ).
cnf(c_0_40,axiom,
( 'E'(s('0'),f(suc(X1)))
| 'LE'(f(X1),s('0'))
| ~ 'LE'(f(suc(X1)),s(s('0'))) ),
clause_15 ).
cnf(c_0_41,plain,
'LE'(f(X1),s(s('0'))),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_38]),c_0_34]),c_0_33]) ).
cnf(c_0_42,axiom,
( 'E'(s('0'),f(X1))
| 'LE'(f(X1),s('0'))
| ~ 'LE'(f(X1),s(s('0'))) ),
clause_6 ).
cnf(c_0_43,axiom,
( ~ iLEQ(suc(X1),suc(X2))
| ~ 'E'(s('0'),f(suc(X3)))
| ~ iLEQ(suc(X3),suc(X1))
| ~ 'E'(s('0'),f(suc(X2)))
| ~ 'E'(s('0'),f(X3))
| ~ 'E'(s('0'),f(X2))
| ~ 'E'(s('0'),f(suc(X1)))
| ~ 'E'(s('0'),f(X1)) ),
clause_21 ).
cnf(c_0_44,plain,
( 'LE'(f(X1),s('0'))
| 'E'(s('0'),f(suc(X1))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_40,c_0_41])]) ).
cnf(c_0_45,plain,
( 'LE'(f(X1),s('0'))
| 'E'(s('0'),f(X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_41])]) ).
cnf(c_0_46,plain,
( 'LE'(f(X1),s('0'))
| ~ iLEQ(suc(X1),suc(X2))
| ~ iLEQ(suc(X2),suc(X3))
| ~ 'E'(s('0'),f(suc(X3)))
| ~ 'E'(s('0'),f(suc(X2)))
| ~ 'E'(s('0'),f(X3))
| ~ 'E'(s('0'),f(X2)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45]) ).
cnf(c_0_47,plain,
( 'LE'(f(X1),s('0'))
| 'LE'(f(X2),s('0'))
| ~ iLEQ(suc(X2),suc(X3))
| ~ iLEQ(suc(X3),suc(X1))
| ~ 'E'(s('0'),f(suc(X3)))
| ~ 'E'(s('0'),f(X3)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_44]),c_0_45]) ).
cnf(c_0_48,plain,
( 'LE'(f(X1),s('0'))
| 'LE'(f(X2),s('0'))
| 'LE'(f(X3),s('0'))
| ~ iLEQ(suc(X2),suc(X1))
| ~ iLEQ(suc(X1),suc(X3)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_44]),c_0_45]) ).
cnf(c_0_49,axiom,
( iLEQ(suc(X1),suc(X1))
| ~ 'E'(s('0'),f(X1))
| ~ 'E'(s('0'),f(suc(X1))) ),
clause_91 ).
cnf(c_0_50,plain,
( 'LE'(f(X1),s('0'))
| 'LE'(f(X2),s('0'))
| ~ iLEQ(suc(X2),suc(X1)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_45]),c_0_44]) ).
cnf(c_0_51,axiom,
( 'E'('0',f(suc(X1)))
| 'LE'(f(X1),'0')
| ~ 'LE'(f(suc(X1)),s('0')) ),
clause_114 ).
cnf(c_0_52,plain,
'LE'(f(X1),s('0')),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_49]),c_0_45]),c_0_44]) ).
cnf(c_0_53,axiom,
( 'E'('0',f(X1))
| 'LE'(f(X1),'0')
| ~ 'LE'(f(X1),s('0')) ),
clause_96 ).
cnf(c_0_54,axiom,
( ~ 'E'('0',f(suc(X1)))
| ~ iLEQ(suc(X1),suc(X2))
| ~ iLEQ(suc(X3),suc(X1))
| ~ 'E'('0',f(suc(X2)))
| ~ 'E'('0',f(X1))
| ~ 'E'('0',f(suc(X3)))
| ~ 'E'('0',f(X2))
| ~ 'E'('0',f(X3)) ),
clause_144 ).
cnf(c_0_55,plain,
( 'LE'(f(X1),'0')
| 'E'('0',f(suc(X1))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_51,c_0_52])]) ).
cnf(c_0_56,plain,
( 'LE'(f(X1),'0')
| 'E'('0',f(X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_53,c_0_52])]) ).
cnf(c_0_57,plain,
( 'LE'(f(X1),'0')
| ~ iLEQ(suc(X1),suc(X2))
| ~ iLEQ(suc(X2),suc(X3))
| ~ 'E'('0',f(suc(X3)))
| ~ 'E'('0',f(suc(X2)))
| ~ 'E'('0',f(X3))
| ~ 'E'('0',f(X2)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_56]) ).
cnf(c_0_58,plain,
( 'LE'(f(X1),'0')
| 'LE'(f(X2),'0')
| ~ iLEQ(suc(X2),suc(X3))
| ~ iLEQ(suc(X3),suc(X1))
| ~ 'E'('0',f(suc(X3)))
| ~ 'E'('0',f(X3)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_55]),c_0_56]) ).
cnf(c_0_59,plain,
( 'LE'(f(X1),'0')
| 'LE'(f(X2),'0')
| 'LE'(f(X3),'0')
| ~ iLEQ(suc(X2),suc(X1))
| ~ iLEQ(suc(X1),suc(X3)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_55]),c_0_56]) ).
cnf(c_0_60,axiom,
( iLEQ(suc(X1),suc(X1))
| ~ 'E'('0',f(X1))
| ~ 'E'('0',f(suc(X1))) ),
clause_109 ).
cnf(c_0_61,plain,
( 'LE'(f(X1),'0')
| 'LE'(f(X2),'0')
| ~ iLEQ(suc(X2),suc(X1)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_56]),c_0_55]) ).
cnf(c_0_62,axiom,
~ 'LE'(f(z),'0'),
clause_66 ).
cnf(c_0_63,plain,
'LE'(f(X1),'0'),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_60]),c_0_56]),c_0_55]) ).
cnf(c_0_64,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_62,c_0_63])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : SYO680-1 : TPTP v8.1.2. Released v7.3.0.
% 0.08/0.15 % Command : run_E %s %d THM
% 0.14/0.37 % Computer : n011.cluster.edu
% 0.14/0.37 % Model : x86_64 x86_64
% 0.14/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.37 % Memory : 8042.1875MB
% 0.14/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.37 % CPULimit : 2400
% 0.14/0.37 % WCLimit : 300
% 0.14/0.37 % DateTime : Mon Oct 2 16:06:38 EDT 2023
% 0.14/0.37 % CPUTime :
% 0.23/0.51 Running first-order model finding
% 0.23/0.51 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.jK2cNcaM4K/E---3.1_32041.p
% 0.23/0.54 # Version: 3.1pre001
% 0.23/0.54 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.54 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.23/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.23/0.54 # Starting sh5l with 300s (1) cores
% 0.23/0.54 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 32118 completed with status 0
% 0.23/0.54 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.23/0.54 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.54 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.54 # No SInE strategy applied
% 0.23/0.54 # Search class: FGHNF-FFMF11-MFFFFFNN
% 0.23/0.54 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/0.54 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.23/0.54 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.23/0.54 # Starting new_bool_3 with 136s (1) cores
% 0.23/0.54 # Starting new_bool_1 with 136s (1) cores
% 0.23/0.54 # Starting sh5l with 136s (1) cores
% 0.23/0.54 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 32126 completed with status 0
% 0.23/0.54 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.23/0.54 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.54 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.54 # No SInE strategy applied
% 0.23/0.54 # Search class: FGHNF-FFMF11-MFFFFFNN
% 0.23/0.54 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/0.54 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.23/0.54 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.23/0.54 # Preprocessing time : 0.001 s
% 0.23/0.54 # Presaturation interreduction done
% 0.23/0.54
% 0.23/0.54 # Proof found!
% 0.23/0.54 # SZS status Unsatisfiable
% 0.23/0.54 # SZS output start CNFRefutation
% See solution above
% 0.23/0.54 # Parsed axioms : 18
% 0.23/0.54 # Removed by relevancy pruning/SinE : 0
% 0.23/0.54 # Initial clauses : 18
% 0.23/0.54 # Removed in clause preprocessing : 0
% 0.23/0.54 # Initial clauses in saturation : 18
% 0.23/0.54 # Processed clauses : 89
% 0.23/0.54 # ...of these trivial : 0
% 0.23/0.54 # ...subsumed : 0
% 0.23/0.54 # ...remaining for further processing : 89
% 0.23/0.54 # Other redundant clauses eliminated : 0
% 0.23/0.54 # Clauses deleted for lack of memory : 0
% 0.23/0.54 # Backward-subsumed : 30
% 0.23/0.54 # Backward-rewritten : 27
% 0.23/0.54 # Generated clauses : 92
% 0.23/0.54 # ...of the previous two non-redundant : 98
% 0.23/0.54 # ...aggressively subsumed : 0
% 0.23/0.54 # Contextual simplify-reflections : 28
% 0.23/0.54 # Paramodulations : 92
% 0.23/0.54 # Factorizations : 0
% 0.23/0.54 # NegExts : 0
% 0.23/0.54 # Equation resolutions : 0
% 0.23/0.54 # Total rewrite steps : 37
% 0.23/0.54 # Propositional unsat checks : 0
% 0.23/0.54 # Propositional check models : 0
% 0.23/0.54 # Propositional check unsatisfiable : 0
% 0.23/0.54 # Propositional clauses : 0
% 0.23/0.54 # Propositional clauses after purity: 0
% 0.23/0.54 # Propositional unsat core size : 0
% 0.23/0.54 # Propositional preprocessing time : 0.000
% 0.23/0.54 # Propositional encoding time : 0.000
% 0.23/0.54 # Propositional solver time : 0.000
% 0.23/0.54 # Success case prop preproc time : 0.000
% 0.23/0.54 # Success case prop encoding time : 0.000
% 0.23/0.54 # Success case prop solver time : 0.000
% 0.23/0.54 # Current number of processed clauses : 14
% 0.23/0.54 # Positive orientable unit clauses : 6
% 0.23/0.54 # Positive unorientable unit clauses: 0
% 0.23/0.54 # Negative unit clauses : 0
% 0.23/0.54 # Non-unit-clauses : 8
% 0.23/0.54 # Current number of unprocessed clauses: 21
% 0.23/0.54 # ...number of literals in the above : 155
% 0.23/0.54 # Current number of archived formulas : 0
% 0.23/0.54 # Current number of archived clauses : 75
% 0.23/0.54 # Clause-clause subsumption calls (NU) : 561
% 0.23/0.54 # Rec. Clause-clause subsumption calls : 191
% 0.23/0.54 # Non-unit clause-clause subsumptions : 51
% 0.23/0.54 # Unit Clause-clause subsumption calls : 21
% 0.23/0.54 # Rewrite failures with RHS unbound : 0
% 0.23/0.54 # BW rewrite match attempts : 18
% 0.23/0.54 # BW rewrite match successes : 13
% 0.23/0.54 # Condensation attempts : 0
% 0.23/0.54 # Condensation successes : 0
% 0.23/0.54 # Termbank termtop insertions : 6519
% 0.23/0.54
% 0.23/0.54 # -------------------------------------------------
% 0.23/0.54 # User time : 0.011 s
% 0.23/0.54 # System time : 0.002 s
% 0.23/0.54 # Total time : 0.013 s
% 0.23/0.54 # Maximum resident set size: 1652 pages
% 0.23/0.54
% 0.23/0.54 # -------------------------------------------------
% 0.23/0.54 # User time : 0.050 s
% 0.23/0.54 # System time : 0.009 s
% 0.23/0.54 # Total time : 0.059 s
% 0.23/0.54 # Maximum resident set size: 1692 pages
% 0.23/0.54 % E---3.1 exiting
%------------------------------------------------------------------------------