TSTP Solution File: SYO652-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SYO652-1 : TPTP v8.1.2. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n026.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 : Sat May 4 10:35:30 EDT 2024
% Result : Unsatisfiable 0.22s 0.52s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 9
% Syntax : Number of clauses : 49 ( 11 unt; 27 nHn; 44 RR)
% Number of literals : 292 ( 0 equ; 211 neg)
% Maximal clause size : 19 ( 5 avg)
% Maximal term depth : 4 ( 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 : 75 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause_191,axiom,
( 'E'('0',f(suc(X1)))
| 'LE'(f(X1),'0')
| ~ 'LE'(f(suc(X1)),s('0')) ),
file('/export/starexec/sandbox2/tmp/tmp.5PgwbkzVxI/E---3.1_412.p',clause_191) ).
cnf(clause_17,axiom,
( 'E'('0',f(X1))
| 'LE'(f(X1),'0')
| ~ 'LE'(f(X1),s('0')) ),
file('/export/starexec/sandbox2/tmp/tmp.5PgwbkzVxI/E---3.1_412.p',clause_17) ).
cnf(clause_3,axiom,
( 'E'('0',f(suc(suc(X1))))
| 'LE'(f(X1),'0')
| ~ 'LE'(f(suc(suc(X1))),s('0')) ),
file('/export/starexec/sandbox2/tmp/tmp.5PgwbkzVxI/E---3.1_412.p',clause_3) ).
cnf(clause_99,axiom,
~ 'LE'(f(z),'0'),
file('/export/starexec/sandbox2/tmp/tmp.5PgwbkzVxI/E---3.1_412.p',clause_99) ).
cnf(clause_199,axiom,
'LE'(f(X1),s('0')),
file('/export/starexec/sandbox2/tmp/tmp.5PgwbkzVxI/E---3.1_412.p',clause_199) ).
cnf(clause_96,axiom,
( ~ 'E'('0',f(suc(X1)))
| ~ iLEQ(suc(X2),suc(X3))
| ~ 'E'('0',f(suc(suc(X1))))
| ~ 'E'('0',f(suc(X4)))
| ~ 'E'('0',f(suc(suc(X4))))
| ~ 'E'('0',f(X1))
| ~ 'E'('0',f(X4))
| ~ 'E'('0',f(X3))
| ~ 'E'('0',f(suc(X2)))
| ~ 'E'(f(X2),f(suc(X2)))
| ~ 'E'('0',f(suc(suc(X2))))
| ~ 'E'(f(X4),f(suc(X4)))
| ~ 'E'(f(X1),f(suc(X1)))
| ~ iLEQ(suc(X4),suc(X1))
| ~ 'E'('0',f(suc(X3)))
| ~ 'E'('0',f(X2))
| ~ 'E'('0',f(suc(suc(X3))))
| ~ 'E'(f(X3),f(suc(X3)))
| ~ iLEQ(suc(X1),suc(X2)) ),
file('/export/starexec/sandbox2/tmp/tmp.5PgwbkzVxI/E---3.1_412.p',clause_96) ).
cnf(clause_16,axiom,
( 'E'(f(X4),f(suc(X4)))
| 'E'(f(X1),f(suc(X1)))
| 'E'(f(X2),f(suc(X2)))
| 'E'(f(X3),f(suc(X3)))
| ~ 'E'('0',f(suc(X1)))
| ~ iLEQ(suc(X2),suc(X3))
| ~ 'E'('0',f(suc(X4)))
| ~ 'E'('0',f(X1))
| ~ 'E'('0',f(X4))
| ~ 'E'('0',f(X3))
| ~ 'E'('0',f(suc(X2)))
| ~ iLEQ(suc(X4),suc(X1))
| ~ 'E'('0',f(suc(X3)))
| ~ 'E'('0',f(X2))
| ~ iLEQ(suc(X1),suc(X2)) ),
file('/export/starexec/sandbox2/tmp/tmp.5PgwbkzVxI/E---3.1_412.p',clause_16) ).
cnf(clause_44,axiom,
( 'E'(f(X1),f(suc(X1)))
| iLEQ(suc(X1),suc(X1))
| ~ 'E'('0',f(X1))
| ~ 'E'('0',f(suc(X1))) ),
file('/export/starexec/sandbox2/tmp/tmp.5PgwbkzVxI/E---3.1_412.p',clause_44) ).
cnf(clause_149,axiom,
( iLEQ(suc(X1),suc(X1))
| ~ 'E'('0',f(suc(suc(X1))))
| ~ 'E'('0',f(suc(X1)))
| ~ 'E'(f(X1),f(suc(X1)))
| ~ 'E'('0',f(X1)) ),
file('/export/starexec/sandbox2/tmp/tmp.5PgwbkzVxI/E---3.1_412.p',clause_149) ).
cnf(c_0_9,plain,
( 'E'('0',f(suc(X1)))
| 'LE'(f(X1),'0')
| ~ 'LE'(f(suc(X1)),s('0')) ),
inference(fof_simplification,[status(thm)],[clause_191]) ).
cnf(c_0_10,plain,
( 'E'('0',f(X1))
| 'LE'(f(X1),'0')
| ~ 'LE'(f(X1),s('0')) ),
inference(fof_simplification,[status(thm)],[clause_17]) ).
cnf(c_0_11,plain,
( 'E'('0',f(suc(suc(X1))))
| 'LE'(f(X1),'0')
| ~ 'LE'(f(suc(suc(X1))),s('0')) ),
inference(fof_simplification,[status(thm)],[clause_3]) ).
cnf(c_0_12,plain,
~ 'LE'(f(z),'0'),
inference(fof_simplification,[status(thm)],[clause_99]) ).
cnf(c_0_13,plain,
( 'E'('0',f(suc(X1)))
| 'LE'(f(X1),'0')
| ~ 'LE'(f(suc(X1)),s('0')) ),
c_0_9 ).
cnf(c_0_14,axiom,
'LE'(f(X1),s('0')),
clause_199 ).
cnf(c_0_15,plain,
( 'E'('0',f(X1))
| 'LE'(f(X1),'0')
| ~ 'LE'(f(X1),s('0')) ),
c_0_10 ).
cnf(c_0_16,plain,
( ~ 'E'('0',f(suc(X1)))
| ~ iLEQ(suc(X2),suc(X3))
| ~ 'E'('0',f(suc(suc(X1))))
| ~ 'E'('0',f(suc(X4)))
| ~ 'E'('0',f(suc(suc(X4))))
| ~ 'E'('0',f(X1))
| ~ 'E'('0',f(X4))
| ~ 'E'('0',f(X3))
| ~ 'E'('0',f(suc(X2)))
| ~ 'E'(f(X2),f(suc(X2)))
| ~ 'E'('0',f(suc(suc(X2))))
| ~ 'E'(f(X4),f(suc(X4)))
| ~ 'E'(f(X1),f(suc(X1)))
| ~ iLEQ(suc(X4),suc(X1))
| ~ 'E'('0',f(suc(X3)))
| ~ 'E'('0',f(X2))
| ~ 'E'('0',f(suc(suc(X3))))
| ~ 'E'(f(X3),f(suc(X3)))
| ~ iLEQ(suc(X1),suc(X2)) ),
inference(fof_simplification,[status(thm)],[clause_96]) ).
cnf(c_0_17,plain,
( 'E'('0',f(suc(suc(X1))))
| 'LE'(f(X1),'0')
| ~ 'LE'(f(suc(suc(X1))),s('0')) ),
c_0_11 ).
cnf(c_0_18,plain,
( 'E'(f(X4),f(suc(X4)))
| 'E'(f(X1),f(suc(X1)))
| 'E'(f(X2),f(suc(X2)))
| 'E'(f(X3),f(suc(X3)))
| ~ 'E'('0',f(suc(X1)))
| ~ iLEQ(suc(X2),suc(X3))
| ~ 'E'('0',f(suc(X4)))
| ~ 'E'('0',f(X1))
| ~ 'E'('0',f(X4))
| ~ 'E'('0',f(X3))
| ~ 'E'('0',f(suc(X2)))
| ~ iLEQ(suc(X4),suc(X1))
| ~ 'E'('0',f(suc(X3)))
| ~ 'E'('0',f(X2))
| ~ iLEQ(suc(X1),suc(X2)) ),
inference(fof_simplification,[status(thm)],[clause_16]) ).
cnf(c_0_19,plain,
~ 'LE'(f(z),'0'),
c_0_12 ).
cnf(c_0_20,plain,
( 'LE'(f(X1),'0')
| 'E'('0',f(suc(X1))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14])]) ).
cnf(c_0_21,plain,
( 'LE'(f(X1),'0')
| 'E'('0',f(X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_14])]) ).
cnf(c_0_22,plain,
( 'E'(f(X1),f(suc(X1)))
| iLEQ(suc(X1),suc(X1))
| ~ 'E'('0',f(X1))
| ~ 'E'('0',f(suc(X1))) ),
inference(fof_simplification,[status(thm)],[clause_44]) ).
cnf(c_0_23,plain,
( ~ 'E'('0',f(suc(X1)))
| ~ iLEQ(suc(X2),suc(X3))
| ~ 'E'('0',f(suc(suc(X1))))
| ~ 'E'('0',f(suc(X4)))
| ~ 'E'('0',f(suc(suc(X4))))
| ~ 'E'('0',f(X1))
| ~ 'E'('0',f(X4))
| ~ 'E'('0',f(X3))
| ~ 'E'('0',f(suc(X2)))
| ~ 'E'(f(X2),f(suc(X2)))
| ~ 'E'('0',f(suc(suc(X2))))
| ~ 'E'(f(X4),f(suc(X4)))
| ~ 'E'(f(X1),f(suc(X1)))
| ~ iLEQ(suc(X4),suc(X1))
| ~ 'E'('0',f(suc(X3)))
| ~ 'E'('0',f(X2))
| ~ 'E'('0',f(suc(suc(X3))))
| ~ 'E'(f(X3),f(suc(X3)))
| ~ iLEQ(suc(X1),suc(X2)) ),
c_0_16 ).
cnf(c_0_24,plain,
( 'LE'(f(X1),'0')
| 'E'('0',f(suc(suc(X1)))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_14])]) ).
cnf(c_0_25,plain,
( 'E'(f(X4),f(suc(X4)))
| 'E'(f(X1),f(suc(X1)))
| 'E'(f(X2),f(suc(X2)))
| 'E'(f(X3),f(suc(X3)))
| ~ 'E'('0',f(suc(X1)))
| ~ iLEQ(suc(X2),suc(X3))
| ~ 'E'('0',f(suc(X4)))
| ~ 'E'('0',f(X1))
| ~ 'E'('0',f(X4))
| ~ 'E'('0',f(X3))
| ~ 'E'('0',f(suc(X2)))
| ~ iLEQ(suc(X4),suc(X1))
| ~ 'E'('0',f(suc(X3)))
| ~ 'E'('0',f(X2))
| ~ iLEQ(suc(X1),suc(X2)) ),
c_0_18 ).
cnf(c_0_26,plain,
'E'('0',f(suc(z))),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_27,plain,
'E'('0',f(z)),
inference(spm,[status(thm)],[c_0_19,c_0_21]) ).
cnf(c_0_28,plain,
( 'E'(f(X1),f(suc(X1)))
| iLEQ(suc(X1),suc(X1))
| ~ 'E'('0',f(X1))
| ~ 'E'('0',f(suc(X1))) ),
c_0_22 ).
cnf(c_0_29,plain,
( 'LE'(f(X1),'0')
| ~ iLEQ(suc(X1),suc(X2))
| ~ iLEQ(suc(X3),suc(X4))
| ~ iLEQ(suc(X2),suc(X3))
| ~ 'E'('0',f(suc(suc(X4))))
| ~ 'E'('0',f(suc(suc(X3))))
| ~ 'E'('0',f(suc(suc(X2))))
| ~ 'E'(f(X1),f(suc(X1)))
| ~ 'E'(f(X4),f(suc(X4)))
| ~ 'E'(f(X3),f(suc(X3)))
| ~ 'E'(f(X2),f(suc(X2)))
| ~ 'E'('0',f(suc(X4)))
| ~ 'E'('0',f(suc(X3)))
| ~ 'E'('0',f(suc(X2)))
| ~ 'E'('0',f(X4))
| ~ 'E'('0',f(X3))
| ~ 'E'('0',f(X2)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_21]),c_0_20]) ).
cnf(c_0_30,plain,
( 'E'(f(z),f(suc(z)))
| 'E'(f(X1),f(suc(X1)))
| 'E'(f(X2),f(suc(X2)))
| 'E'(f(X3),f(suc(X3)))
| ~ iLEQ(suc(z),suc(X1))
| ~ iLEQ(suc(X2),suc(X3))
| ~ iLEQ(suc(X1),suc(X2))
| ~ 'E'('0',f(suc(X3)))
| ~ 'E'('0',f(suc(X2)))
| ~ 'E'('0',f(suc(X1)))
| ~ 'E'('0',f(X3))
| ~ 'E'('0',f(X2))
| ~ 'E'('0',f(X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27])]) ).
cnf(c_0_31,plain,
( iLEQ(suc(z),suc(z))
| 'E'(f(z),f(suc(z))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_26]),c_0_27])]) ).
cnf(c_0_32,plain,
( 'LE'(f(X1),'0')
| 'LE'(f(X2),'0')
| ~ iLEQ(suc(X2),suc(X3))
| ~ iLEQ(suc(X4),suc(X1))
| ~ iLEQ(suc(X3),suc(X4))
| ~ 'E'('0',f(suc(suc(X4))))
| ~ 'E'('0',f(suc(suc(X3))))
| ~ 'E'(f(X2),f(suc(X2)))
| ~ 'E'(f(X1),f(suc(X1)))
| ~ 'E'(f(X4),f(suc(X4)))
| ~ 'E'(f(X3),f(suc(X3)))
| ~ 'E'('0',f(suc(X4)))
| ~ 'E'('0',f(suc(X3)))
| ~ 'E'('0',f(X4))
| ~ 'E'('0',f(X3)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_24]),c_0_21]),c_0_20]) ).
cnf(c_0_33,plain,
( 'E'(f(z),f(suc(z)))
| 'E'(f(X1),f(suc(X1)))
| 'E'(f(X2),f(suc(X2)))
| ~ iLEQ(suc(z),suc(X2))
| ~ iLEQ(suc(X2),suc(X1))
| ~ 'E'('0',f(suc(X1)))
| ~ 'E'('0',f(suc(X2)))
| ~ 'E'('0',f(X1))
| ~ 'E'('0',f(X2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_26]),c_0_27])]) ).
cnf(c_0_34,plain,
( 'LE'(f(X1),'0')
| 'LE'(f(X2),'0')
| 'LE'(f(X3),'0')
| ~ iLEQ(suc(X2),suc(X4))
| ~ iLEQ(suc(X1),suc(X3))
| ~ iLEQ(suc(X4),suc(X1))
| ~ 'E'('0',f(suc(suc(X4))))
| ~ 'E'(f(X2),f(suc(X2)))
| ~ 'E'(f(X3),f(suc(X3)))
| ~ 'E'(f(X1),f(suc(X1)))
| ~ 'E'(f(X4),f(suc(X4)))
| ~ 'E'('0',f(suc(X4)))
| ~ 'E'('0',f(X4)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_24]),c_0_21]),c_0_20]) ).
cnf(c_0_35,plain,
( 'E'(f(z),f(suc(z)))
| 'E'(f(X1),f(suc(X1)))
| ~ iLEQ(suc(z),suc(X1))
| ~ 'E'('0',f(suc(X1)))
| ~ 'E'('0',f(X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_31]),c_0_26]),c_0_27])]) ).
cnf(c_0_36,plain,
( 'LE'(f(X1),'0')
| 'LE'(f(X2),'0')
| 'LE'(f(X3),'0')
| 'LE'(f(X4),'0')
| ~ iLEQ(suc(X3),suc(X1))
| ~ iLEQ(suc(X4),suc(X2))
| ~ iLEQ(suc(X1),suc(X4))
| ~ 'E'(f(X3),f(suc(X3)))
| ~ 'E'(f(X2),f(suc(X2)))
| ~ 'E'(f(X4),f(suc(X4)))
| ~ 'E'(f(X1),f(suc(X1))) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_24]),c_0_21]),c_0_20]) ).
cnf(c_0_37,plain,
'E'(f(z),f(suc(z))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_31]),c_0_26]),c_0_27])]) ).
cnf(c_0_38,plain,
( 'LE'(f(X1),'0')
| 'LE'(f(X2),'0')
| 'LE'(f(X3),'0')
| ~ iLEQ(suc(z),suc(X3))
| ~ iLEQ(suc(X1),suc(X2))
| ~ iLEQ(suc(X3),suc(X1))
| ~ 'E'(f(X2),f(suc(X2)))
| ~ 'E'(f(X1),f(suc(X1)))
| ~ 'E'(f(X3),f(suc(X3))) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_19]) ).
cnf(c_0_39,plain,
( iLEQ(suc(X1),suc(X1))
| ~ 'E'('0',f(suc(suc(X1))))
| ~ 'E'('0',f(suc(X1)))
| ~ 'E'(f(X1),f(suc(X1)))
| ~ 'E'('0',f(X1)) ),
inference(fof_simplification,[status(thm)],[clause_149]) ).
cnf(c_0_40,plain,
( 'LE'(f(X1),'0')
| 'LE'(f(X2),'0')
| ~ iLEQ(suc(z),suc(X1))
| ~ iLEQ(suc(X2),suc(z))
| ~ iLEQ(suc(X1),suc(X2))
| ~ 'E'(f(X2),f(suc(X2)))
| ~ 'E'(f(X1),f(suc(X1))) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_37]),c_0_19]) ).
cnf(c_0_41,plain,
( iLEQ(suc(X1),suc(X1))
| ~ 'E'('0',f(suc(suc(X1))))
| ~ 'E'('0',f(suc(X1)))
| ~ 'E'(f(X1),f(suc(X1)))
| ~ 'E'('0',f(X1)) ),
c_0_39 ).
cnf(c_0_42,plain,
( 'LE'(f(X1),'0')
| ~ iLEQ(suc(z),suc(z))
| ~ iLEQ(suc(z),suc(X1))
| ~ iLEQ(suc(X1),suc(z))
| ~ 'E'(f(X1),f(suc(X1))) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_37]),c_0_19]) ).
cnf(c_0_43,plain,
( iLEQ(suc(X1),suc(X1))
| ~ 'E'('0',f(suc(suc(X1))))
| ~ 'E'('0',f(suc(X1)))
| ~ 'E'('0',f(X1)) ),
inference(csr,[status(thm)],[c_0_41,c_0_28]) ).
cnf(c_0_44,plain,
( 'LE'(f(X1),'0')
| ~ iLEQ(suc(z),suc(X1))
| ~ iLEQ(suc(X1),suc(z))
| ~ 'E'('0',f(suc(suc(z))))
| ~ 'E'(f(X1),f(suc(X1))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_26]),c_0_27])]) ).
cnf(c_0_45,plain,
( 'LE'(f(X1),'0')
| ~ iLEQ(suc(z),suc(X1))
| ~ iLEQ(suc(X1),suc(z))
| ~ 'E'(f(X1),f(suc(X1))) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_24]),c_0_19]) ).
cnf(c_0_46,plain,
~ iLEQ(suc(z),suc(z)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_37]),c_0_19]) ).
cnf(c_0_47,plain,
~ 'E'('0',f(suc(suc(z)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_43]),c_0_26]),c_0_27])]) ).
cnf(c_0_48,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_24]),c_0_19]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : SYO652-1 : TPTP v8.1.2. Released v7.3.0.
% 0.11/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n026.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Fri May 3 10:17:51 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.22/0.49 Running first-order theorem proving
% 0.22/0.49 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.5PgwbkzVxI/E---3.1_412.p
% 0.22/0.52 # Version: 3.1.0
% 0.22/0.52 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.22/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.22/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.52 # Starting sh5l with 300s (1) cores
% 0.22/0.52 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 506 completed with status 0
% 0.22/0.52 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.22/0.52 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.22/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.22/0.52 # No SInE strategy applied
% 0.22/0.52 # Search class: FGHNF-FFMF11-MFFFFFNN
% 0.22/0.52 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.52 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.22/0.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.22/0.52 # Starting new_bool_3 with 136s (1) cores
% 0.22/0.52 # Starting new_bool_1 with 136s (1) cores
% 0.22/0.52 # Starting sh5l with 136s (1) cores
% 0.22/0.52 # G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 516 completed with status 0
% 0.22/0.52 # Result found by G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.22/0.52 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.22/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.22/0.52 # No SInE strategy applied
% 0.22/0.52 # Search class: FGHNF-FFMF11-MFFFFFNN
% 0.22/0.52 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.52 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.22/0.52 # Preprocessing time : 0.002 s
% 0.22/0.52 # Presaturation interreduction done
% 0.22/0.52
% 0.22/0.52 # Proof found!
% 0.22/0.52 # SZS status Unsatisfiable
% 0.22/0.52 # SZS output start CNFRefutation
% See solution above
% 0.22/0.52 # Parsed axioms : 23
% 0.22/0.52 # Removed by relevancy pruning/SinE : 0
% 0.22/0.52 # Initial clauses : 23
% 0.22/0.52 # Removed in clause preprocessing : 0
% 0.22/0.52 # Initial clauses in saturation : 23
% 0.22/0.52 # Processed clauses : 54
% 0.22/0.52 # ...of these trivial : 0
% 0.22/0.52 # ...subsumed : 0
% 0.22/0.52 # ...remaining for further processing : 54
% 0.22/0.52 # Other redundant clauses eliminated : 0
% 0.22/0.52 # Clauses deleted for lack of memory : 0
% 0.22/0.52 # Backward-subsumed : 4
% 0.22/0.52 # Backward-rewritten : 2
% 0.22/0.52 # Generated clauses : 27
% 0.22/0.52 # ...of the previous two non-redundant : 26
% 0.22/0.52 # ...aggressively subsumed : 0
% 0.22/0.52 # Contextual simplify-reflections : 26
% 0.22/0.52 # Paramodulations : 27
% 0.22/0.52 # Factorizations : 0
% 0.22/0.52 # NegExts : 0
% 0.22/0.52 # Equation resolutions : 0
% 0.22/0.52 # Disequality decompositions : 0
% 0.22/0.52 # Total rewrite steps : 23
% 0.22/0.52 # ...of those cached : 17
% 0.22/0.52 # Propositional unsat checks : 0
% 0.22/0.52 # Propositional check models : 0
% 0.22/0.52 # Propositional check unsatisfiable : 0
% 0.22/0.52 # Propositional clauses : 0
% 0.22/0.52 # Propositional clauses after purity: 0
% 0.22/0.52 # Propositional unsat core size : 0
% 0.22/0.52 # Propositional preprocessing time : 0.000
% 0.22/0.52 # Propositional encoding time : 0.000
% 0.22/0.52 # Propositional solver time : 0.000
% 0.22/0.52 # Success case prop preproc time : 0.000
% 0.22/0.52 # Success case prop encoding time : 0.000
% 0.22/0.52 # Success case prop solver time : 0.000
% 0.22/0.52 # Current number of processed clauses : 25
% 0.22/0.52 # Positive orientable unit clauses : 4
% 0.22/0.52 # Positive unorientable unit clauses: 0
% 0.22/0.52 # Negative unit clauses : 3
% 0.22/0.52 # Non-unit-clauses : 18
% 0.22/0.52 # Current number of unprocessed clauses: 15
% 0.22/0.52 # ...number of literals in the above : 237
% 0.22/0.52 # Current number of archived formulas : 0
% 0.22/0.52 # Current number of archived clauses : 29
% 0.22/0.52 # Clause-clause subsumption calls (NU) : 407
% 0.22/0.52 # Rec. Clause-clause subsumption calls : 203
% 0.22/0.52 # Non-unit clause-clause subsumptions : 30
% 0.22/0.52 # Unit Clause-clause subsumption calls : 30
% 0.22/0.52 # Rewrite failures with RHS unbound : 0
% 0.22/0.52 # BW rewrite match attempts : 2
% 0.22/0.52 # BW rewrite match successes : 1
% 0.22/0.52 # Condensation attempts : 0
% 0.22/0.52 # Condensation successes : 0
% 0.22/0.52 # Termbank termtop insertions : 9562
% 0.22/0.52 # Search garbage collected termcells : 286
% 0.22/0.52
% 0.22/0.52 # -------------------------------------------------
% 0.22/0.52 # User time : 0.016 s
% 0.22/0.52 # System time : 0.002 s
% 0.22/0.52 # Total time : 0.018 s
% 0.22/0.52 # Maximum resident set size: 1792 pages
% 0.22/0.52
% 0.22/0.52 # -------------------------------------------------
% 0.22/0.52 # User time : 0.072 s
% 0.22/0.52 # System time : 0.006 s
% 0.22/0.52 # Total time : 0.078 s
% 0.22/0.52 # Maximum resident set size: 1736 pages
% 0.22/0.52 % E---3.1 exiting
% 0.22/0.52 % E exiting
%------------------------------------------------------------------------------