TSTP Solution File: SYO655-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SYO655-1 : TPTP v8.1.2. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n003.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:47:09 EDT 2023
% Result : Unsatisfiable 0.22s 0.57s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 9
% Syntax : Number of clauses : 38 ( 10 unt; 17 nHn; 33 RR)
% Number of literals : 273 ( 0 equ; 217 neg)
% Maximal clause size : 24 ( 7 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 : 62 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause_5,axiom,
( 'E'('0',f(suc(X1)))
| 'LE'(f(X1),'0')
| ~ 'LE'(f(suc(X1)),s('0')) ),
file('/export/starexec/sandbox2/tmp/tmp.xGLgfq2tyc/E---3.1_11395.p',clause_5) ).
cnf(clause_497,axiom,
'LE'(f(X1),s('0')),
file('/export/starexec/sandbox2/tmp/tmp.xGLgfq2tyc/E---3.1_11395.p',clause_497) ).
cnf(clause_513,axiom,
( 'E'('0',f(X1))
| 'LE'(f(X1),'0')
| ~ 'LE'(f(X1),s('0')) ),
file('/export/starexec/sandbox2/tmp/tmp.xGLgfq2tyc/E---3.1_11395.p',clause_513) ).
cnf(clause_269,axiom,
~ 'LE'(f(z),'0'),
file('/export/starexec/sandbox2/tmp/tmp.xGLgfq2tyc/E---3.1_11395.p',clause_269) ).
cnf(clause_72,axiom,
( 'E'('0',f(suc(suc(X1))))
| 'LE'(f(X1),'0')
| ~ 'LE'(f(suc(suc(X1))),s('0')) ),
file('/export/starexec/sandbox2/tmp/tmp.xGLgfq2tyc/E---3.1_11395.p',clause_72) ).
cnf(clause_209,axiom,
( 'E'(f(X2),f(suc(X2)))
| 'E'(f(X3),f(suc(X3)))
| 'E'(f(X1),f(suc(X1)))
| 'E'(f(X5),f(suc(X5)))
| 'E'(f(X4),f(suc(X4)))
| ~ 'E'('0',f(suc(X1)))
| ~ iLEQ(suc(X2),suc(X1))
| ~ 'E'('0',f(suc(X3)))
| ~ 'E'('0',f(suc(X4)))
| ~ iLEQ(suc(X4),suc(X2))
| ~ 'E'('0',f(X1))
| ~ 'E'('0',f(X3))
| ~ iLEQ(suc(X1),suc(X5))
| ~ 'E'('0',f(X2))
| ~ 'E'('0',f(X4))
| ~ 'E'('0',f(suc(X2)))
| ~ 'E'('0',f(X5))
| ~ 'E'('0',f(suc(X5)))
| ~ iLEQ(suc(X3),suc(X4)) ),
file('/export/starexec/sandbox2/tmp/tmp.xGLgfq2tyc/E---3.1_11395.p',clause_209) ).
cnf(clause_379,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.xGLgfq2tyc/E---3.1_11395.p',clause_379) ).
cnf(clause_84,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.xGLgfq2tyc/E---3.1_11395.p',clause_84) ).
cnf(clause_125,axiom,
( ~ 'E'('0',f(suc(suc(X1))))
| ~ 'E'('0',f(suc(X2)))
| ~ iLEQ(suc(X1),suc(X2))
| ~ 'E'('0',f(suc(X3)))
| ~ 'E'('0',f(suc(suc(X3))))
| ~ 'E'('0',f(suc(X4)))
| ~ iLEQ(suc(X4),suc(X1))
| ~ 'E'('0',f(X2))
| ~ 'E'('0',f(suc(suc(X2))))
| ~ 'E'('0',f(suc(suc(X5))))
| ~ 'E'('0',f(X3))
| ~ 'E'(f(X1),f(suc(X1)))
| ~ 'E'('0',f(suc(suc(X4))))
| ~ iLEQ(suc(X2),suc(X5))
| ~ 'E'('0',f(X1))
| ~ 'E'('0',f(X4))
| ~ 'E'('0',f(suc(X1)))
| ~ 'E'(f(X3),f(suc(X3)))
| ~ 'E'(f(X2),f(suc(X2)))
| ~ 'E'(f(X5),f(suc(X5)))
| ~ 'E'('0',f(X5))
| ~ 'E'('0',f(suc(X5)))
| ~ 'E'(f(X4),f(suc(X4)))
| ~ iLEQ(suc(X3),suc(X4)) ),
file('/export/starexec/sandbox2/tmp/tmp.xGLgfq2tyc/E---3.1_11395.p',clause_125) ).
cnf(c_0_9,axiom,
( 'E'('0',f(suc(X1)))
| 'LE'(f(X1),'0')
| ~ 'LE'(f(suc(X1)),s('0')) ),
clause_5 ).
cnf(c_0_10,axiom,
'LE'(f(X1),s('0')),
clause_497 ).
cnf(c_0_11,axiom,
( 'E'('0',f(X1))
| 'LE'(f(X1),'0')
| ~ 'LE'(f(X1),s('0')) ),
clause_513 ).
cnf(c_0_12,axiom,
~ 'LE'(f(z),'0'),
clause_269 ).
cnf(c_0_13,plain,
( 'LE'(f(X1),'0')
| 'E'('0',f(suc(X1))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10])]) ).
cnf(c_0_14,plain,
( 'LE'(f(X1),'0')
| 'E'('0',f(X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_10])]) ).
cnf(c_0_15,axiom,
( 'E'('0',f(suc(suc(X1))))
| 'LE'(f(X1),'0')
| ~ 'LE'(f(suc(suc(X1))),s('0')) ),
clause_72 ).
cnf(c_0_16,axiom,
( 'E'(f(X2),f(suc(X2)))
| 'E'(f(X3),f(suc(X3)))
| 'E'(f(X1),f(suc(X1)))
| 'E'(f(X5),f(suc(X5)))
| 'E'(f(X4),f(suc(X4)))
| ~ 'E'('0',f(suc(X1)))
| ~ iLEQ(suc(X2),suc(X1))
| ~ 'E'('0',f(suc(X3)))
| ~ 'E'('0',f(suc(X4)))
| ~ iLEQ(suc(X4),suc(X2))
| ~ 'E'('0',f(X1))
| ~ 'E'('0',f(X3))
| ~ iLEQ(suc(X1),suc(X5))
| ~ 'E'('0',f(X2))
| ~ 'E'('0',f(X4))
| ~ 'E'('0',f(suc(X2)))
| ~ 'E'('0',f(X5))
| ~ 'E'('0',f(suc(X5)))
| ~ iLEQ(suc(X3),suc(X4)) ),
clause_209 ).
cnf(c_0_17,plain,
'E'('0',f(suc(z))),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_18,plain,
'E'('0',f(z)),
inference(spm,[status(thm)],[c_0_12,c_0_14]) ).
cnf(c_0_19,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)) ),
clause_379 ).
cnf(c_0_20,axiom,
( 'E'(f(X1),f(suc(X1)))
| iLEQ(suc(X1),suc(X1))
| ~ 'E'('0',f(X1))
| ~ 'E'('0',f(suc(X1))) ),
clause_84 ).
cnf(c_0_21,plain,
( 'LE'(f(X1),'0')
| 'E'('0',f(suc(suc(X1)))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_10])]) ).
cnf(c_0_22,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)))
| 'E'(f(X4),f(suc(X4)))
| ~ iLEQ(suc(X1),suc(z))
| ~ iLEQ(suc(X4),suc(X2))
| ~ iLEQ(suc(X3),suc(X4))
| ~ iLEQ(suc(X2),suc(X1))
| ~ 'E'('0',f(suc(X4)))
| ~ 'E'('0',f(suc(X3)))
| ~ 'E'('0',f(suc(X2)))
| ~ 'E'('0',f(suc(X1)))
| ~ 'E'('0',f(X4))
| ~ '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_16,c_0_17]),c_0_18])]) ).
cnf(c_0_23,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_19,c_0_20]) ).
cnf(c_0_24,plain,
'E'('0',f(suc(suc(z)))),
inference(spm,[status(thm)],[c_0_12,c_0_21]) ).
cnf(c_0_25,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(X3),suc(z))
| ~ iLEQ(suc(X1),suc(X3))
| ~ iLEQ(suc(X2),suc(X1))
| ~ '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)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_17]),c_0_18]),c_0_24])]) ).
cnf(c_0_26,plain,
( 'E'(f(z),f(suc(z)))
| 'E'(f(X1),f(suc(X1)))
| 'E'(f(X2),f(suc(X2)))
| ~ iLEQ(suc(X2),suc(z))
| ~ iLEQ(suc(X1),suc(X2))
| ~ 'E'('0',f(suc(X2)))
| ~ 'E'('0',f(suc(X1)))
| ~ 'E'('0',f(X2))
| ~ 'E'('0',f(X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_23]),c_0_17]),c_0_18]),c_0_24])]) ).
cnf(c_0_27,axiom,
( ~ 'E'('0',f(suc(suc(X1))))
| ~ 'E'('0',f(suc(X2)))
| ~ iLEQ(suc(X1),suc(X2))
| ~ 'E'('0',f(suc(X3)))
| ~ 'E'('0',f(suc(suc(X3))))
| ~ 'E'('0',f(suc(X4)))
| ~ iLEQ(suc(X4),suc(X1))
| ~ 'E'('0',f(X2))
| ~ 'E'('0',f(suc(suc(X2))))
| ~ 'E'('0',f(suc(suc(X5))))
| ~ 'E'('0',f(X3))
| ~ 'E'(f(X1),f(suc(X1)))
| ~ 'E'('0',f(suc(suc(X4))))
| ~ iLEQ(suc(X2),suc(X5))
| ~ 'E'('0',f(X1))
| ~ 'E'('0',f(X4))
| ~ 'E'('0',f(suc(X1)))
| ~ 'E'(f(X3),f(suc(X3)))
| ~ 'E'(f(X2),f(suc(X2)))
| ~ 'E'(f(X5),f(suc(X5)))
| ~ 'E'('0',f(X5))
| ~ 'E'('0',f(suc(X5)))
| ~ 'E'(f(X4),f(suc(X4)))
| ~ iLEQ(suc(X3),suc(X4)) ),
clause_125 ).
cnf(c_0_28,plain,
( 'E'(f(z),f(suc(z)))
| 'E'(f(X1),f(suc(X1)))
| ~ iLEQ(suc(X1),suc(z))
| ~ 'E'('0',f(suc(X1)))
| ~ 'E'('0',f(X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_23]),c_0_17]),c_0_18]),c_0_24])]) ).
cnf(c_0_29,plain,
( ~ iLEQ(suc(X1),suc(z))
| ~ iLEQ(suc(X2),suc(X3))
| ~ iLEQ(suc(X4),suc(X2))
| ~ iLEQ(suc(X3),suc(X1))
| ~ 'E'(f(z),f(suc(z)))
| ~ 'E'('0',f(suc(suc(X2))))
| ~ 'E'('0',f(suc(suc(X4))))
| ~ 'E'('0',f(suc(suc(X1))))
| ~ 'E'('0',f(suc(suc(X3))))
| ~ 'E'(f(X2),f(suc(X2)))
| ~ 'E'(f(X4),f(suc(X4)))
| ~ 'E'(f(X1),f(suc(X1)))
| ~ 'E'(f(X3),f(suc(X3)))
| ~ 'E'('0',f(suc(X2)))
| ~ 'E'('0',f(suc(X4)))
| ~ 'E'('0',f(suc(X1)))
| ~ 'E'('0',f(suc(X3)))
| ~ 'E'('0',f(X2))
| ~ 'E'('0',f(X4))
| ~ 'E'('0',f(X1))
| ~ 'E'('0',f(X3)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_24]),c_0_17]),c_0_18])]) ).
cnf(c_0_30,plain,
'E'(f(z),f(suc(z))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_23]),c_0_17]),c_0_18]),c_0_24])]) ).
cnf(c_0_31,plain,
( ~ iLEQ(suc(X1),suc(z))
| ~ iLEQ(suc(X2),suc(X3))
| ~ iLEQ(suc(X4),suc(X2))
| ~ iLEQ(suc(X3),suc(X1))
| ~ 'E'('0',f(suc(suc(X2))))
| ~ 'E'('0',f(suc(suc(X4))))
| ~ 'E'('0',f(suc(suc(X1))))
| ~ 'E'('0',f(suc(suc(X3))))
| ~ 'E'(f(X2),f(suc(X2)))
| ~ 'E'(f(X4),f(suc(X4)))
| ~ 'E'(f(X1),f(suc(X1)))
| ~ 'E'(f(X3),f(suc(X3)))
| ~ 'E'('0',f(suc(X2)))
| ~ 'E'('0',f(suc(X4)))
| ~ 'E'('0',f(suc(X1)))
| ~ 'E'('0',f(suc(X3)))
| ~ 'E'('0',f(X2))
| ~ 'E'('0',f(X4))
| ~ 'E'('0',f(X1))
| ~ 'E'('0',f(X3)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_30])]) ).
cnf(c_0_32,plain,
( ~ iLEQ(suc(X1),suc(z))
| ~ iLEQ(suc(z),suc(X2))
| ~ iLEQ(suc(X3),suc(z))
| ~ iLEQ(suc(X2),suc(X1))
| ~ 'E'('0',f(suc(suc(X3))))
| ~ 'E'('0',f(suc(suc(X1))))
| ~ 'E'('0',f(suc(suc(X2))))
| ~ 'E'(f(X3),f(suc(X3)))
| ~ 'E'(f(X1),f(suc(X1)))
| ~ 'E'(f(X2),f(suc(X2)))
| ~ 'E'('0',f(suc(X3)))
| ~ 'E'('0',f(suc(X1)))
| ~ 'E'('0',f(suc(X2)))
| ~ 'E'('0',f(X3))
| ~ 'E'('0',f(X1))
| ~ 'E'('0',f(X2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_24]),c_0_30]),c_0_17]),c_0_18])]) ).
cnf(c_0_33,plain,
( ~ iLEQ(suc(z),suc(z))
| ~ iLEQ(suc(X1),suc(z))
| ~ iLEQ(suc(z),suc(X2))
| ~ iLEQ(suc(X2),suc(X1))
| ~ 'E'('0',f(suc(suc(X1))))
| ~ 'E'('0',f(suc(suc(X2))))
| ~ 'E'(f(X1),f(suc(X1)))
| ~ 'E'(f(X2),f(suc(X2)))
| ~ '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(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_24]),c_0_30]),c_0_17]),c_0_18])]) ).
cnf(c_0_34,plain,
( ~ iLEQ(suc(X1),suc(z))
| ~ iLEQ(suc(z),suc(X2))
| ~ iLEQ(suc(X2),suc(X1))
| ~ 'E'('0',f(suc(suc(X1))))
| ~ 'E'('0',f(suc(suc(X2))))
| ~ 'E'(f(X1),f(suc(X1)))
| ~ 'E'(f(X2),f(suc(X2)))
| ~ '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(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_23]),c_0_24]),c_0_17]),c_0_18])]) ).
cnf(c_0_35,plain,
( ~ iLEQ(suc(z),suc(z))
| ~ iLEQ(suc(z),suc(X1))
| ~ iLEQ(suc(X1),suc(z))
| ~ 'E'('0',f(suc(suc(X1))))
| ~ 'E'(f(X1),f(suc(X1)))
| ~ 'E'('0',f(suc(X1)))
| ~ 'E'('0',f(X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_24]),c_0_30]),c_0_17]),c_0_18])]) ).
cnf(c_0_36,plain,
~ iLEQ(suc(z),suc(z)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_30]),c_0_24]),c_0_17]),c_0_18])]) ).
cnf(c_0_37,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_23]),c_0_24]),c_0_17]),c_0_18])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.14 % Problem : SYO655-1 : TPTP v8.1.2. Released v7.3.0.
% 0.11/0.15 % Command : run_E %s %d THM
% 0.15/0.36 % Computer : n003.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 2400
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Mon Oct 2 16:07:48 EDT 2023
% 0.15/0.36 % CPUTime :
% 0.22/0.51 Running first-order theorem proving
% 0.22/0.51 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.xGLgfq2tyc/E---3.1_11395.p
% 0.22/0.57 # Version: 3.1pre001
% 0.22/0.57 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.22/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.57 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.22/0.57 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.57 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.57 # Starting sh5l with 300s (1) cores
% 0.22/0.57 # new_bool_3 with pid 11513 completed with status 8
% 0.22/0.57 # new_bool_1 with pid 11514 completed with status 8
% 0.22/0.57 # sh5l with pid 11515 completed with status 8
% 0.22/0.57 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 11512 completed with status 0
% 0.22/0.57 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.22/0.57 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.22/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.57 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.22/0.57 # No SInE strategy applied
% 0.22/0.57 # Search class: FGHNF-FSLF11-MFFFFFNN
% 0.22/0.57 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.57 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.22/0.57 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.22/0.57 # Starting new_bool_3 with 136s (1) cores
% 0.22/0.57 # Starting new_bool_1 with 136s (1) cores
% 0.22/0.57 # Starting sh5l with 136s (1) cores
% 0.22/0.57 # G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 11526 completed with status 0
% 0.22/0.57 # Result found by G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.22/0.57 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.22/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.57 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.22/0.57 # No SInE strategy applied
% 0.22/0.57 # Search class: FGHNF-FSLF11-MFFFFFNN
% 0.22/0.57 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.57 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.22/0.57 # Preprocessing time : 0.004 s
% 0.22/0.57 # Presaturation interreduction done
% 0.22/0.57
% 0.22/0.57 # Proof found!
% 0.22/0.57 # SZS status Unsatisfiable
% 0.22/0.57 # SZS output start CNFRefutation
% See solution above
% 0.22/0.57 # Parsed axioms : 39
% 0.22/0.57 # Removed by relevancy pruning/SinE : 0
% 0.22/0.57 # Initial clauses : 39
% 0.22/0.57 # Removed in clause preprocessing : 0
% 0.22/0.57 # Initial clauses in saturation : 39
% 0.22/0.57 # Processed clauses : 68
% 0.22/0.57 # ...of these trivial : 0
% 0.22/0.57 # ...subsumed : 0
% 0.22/0.57 # ...remaining for further processing : 68
% 0.22/0.57 # Other redundant clauses eliminated : 0
% 0.22/0.57 # Clauses deleted for lack of memory : 0
% 0.22/0.57 # Backward-subsumed : 7
% 0.22/0.57 # Backward-rewritten : 3
% 0.22/0.57 # Generated clauses : 23
% 0.22/0.57 # ...of the previous two non-redundant : 24
% 0.22/0.57 # ...aggressively subsumed : 0
% 0.22/0.57 # Contextual simplify-reflections : 51
% 0.22/0.57 # Paramodulations : 23
% 0.22/0.57 # Factorizations : 0
% 0.22/0.57 # NegExts : 0
% 0.22/0.57 # Equation resolutions : 0
% 0.22/0.57 # Total rewrite steps : 48
% 0.22/0.57 # Propositional unsat checks : 0
% 0.22/0.57 # Propositional check models : 0
% 0.22/0.57 # Propositional check unsatisfiable : 0
% 0.22/0.57 # Propositional clauses : 0
% 0.22/0.57 # Propositional clauses after purity: 0
% 0.22/0.57 # Propositional unsat core size : 0
% 0.22/0.57 # Propositional preprocessing time : 0.000
% 0.22/0.57 # Propositional encoding time : 0.000
% 0.22/0.57 # Propositional solver time : 0.000
% 0.22/0.57 # Success case prop preproc time : 0.000
% 0.22/0.57 # Success case prop encoding time : 0.000
% 0.22/0.57 # Success case prop solver time : 0.000
% 0.22/0.57 # Current number of processed clauses : 19
% 0.22/0.57 # Positive orientable unit clauses : 5
% 0.22/0.57 # Positive unorientable unit clauses: 0
% 0.22/0.57 # Negative unit clauses : 2
% 0.22/0.57 # Non-unit-clauses : 12
% 0.22/0.57 # Current number of unprocessed clauses: 34
% 0.22/0.57 # ...number of literals in the above : 651
% 0.22/0.57 # Current number of archived formulas : 0
% 0.22/0.57 # Current number of archived clauses : 49
% 0.22/0.57 # Clause-clause subsumption calls (NU) : 990
% 0.22/0.57 # Rec. Clause-clause subsumption calls : 606
% 0.22/0.57 # Non-unit clause-clause subsumptions : 56
% 0.22/0.57 # Unit Clause-clause subsumption calls : 18
% 0.22/0.57 # Rewrite failures with RHS unbound : 0
% 0.22/0.57 # BW rewrite match attempts : 22
% 0.22/0.57 # BW rewrite match successes : 1
% 0.22/0.57 # Condensation attempts : 0
% 0.22/0.57 # Condensation successes : 0
% 0.22/0.57 # Termbank termtop insertions : 16436
% 0.22/0.57
% 0.22/0.57 # -------------------------------------------------
% 0.22/0.57 # User time : 0.035 s
% 0.22/0.57 # System time : 0.006 s
% 0.22/0.57 # Total time : 0.041 s
% 0.22/0.57 # Maximum resident set size: 1820 pages
% 0.22/0.57
% 0.22/0.57 # -------------------------------------------------
% 0.22/0.57 # User time : 0.214 s
% 0.22/0.57 # System time : 0.033 s
% 0.22/0.57 # Total time : 0.247 s
% 0.22/0.57 # Maximum resident set size: 1776 pages
% 0.22/0.57 % E---3.1 exiting
% 0.22/0.57 % E---3.1 exiting
%------------------------------------------------------------------------------