TSTP Solution File: ALG071+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : ALG071+1 : TPTP v8.2.0. Released v2.7.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 : Mon May 20 18:07:49 EDT 2024
% Result : Theorem 30.74s 4.37s
% Output : CNFRefutation 30.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 5
% Syntax : Number of formulae : 63 ( 14 unt; 0 def)
% Number of atoms : 176 ( 53 equ)
% Maximal formula atoms : 14 ( 2 avg)
% Number of connectives : 187 ( 74 ~; 63 |; 24 &)
% ( 0 <=>; 26 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 4 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 1 con; 0-2 aty)
% Number of variables : 78 ( 0 sgn 38 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
( ( ! [X1] :
( sorti1(X1)
=> sorti2(h(X1)) )
& ! [X2] :
( sorti2(X2)
=> sorti1(j(X2)) ) )
=> ~ ( ! [X3] :
( sorti1(X3)
=> ! [X4] :
( sorti1(X4)
=> h(op1(X3,X4)) = op2(h(X3),h(X4)) ) )
& ! [X5] :
( sorti2(X5)
=> ! [X6] :
( sorti2(X6)
=> j(op2(X5,X6)) = op1(j(X5),j(X6)) ) )
& ! [X7] :
( sorti2(X7)
=> h(j(X7)) = X7 )
& ! [X8] :
( sorti1(X8)
=> j(h(X8)) = X8 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(ax4,axiom,
~ ! [X1] :
( sorti2(X1)
=> ? [X2] :
( sorti2(X2)
& op2(X2,op2(X2,X1)) != X1
& op2(X1,op2(X2,X1)) = X2 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax4) ).
fof(ax3,axiom,
! [X1] :
( sorti1(X1)
=> ? [X2] :
( sorti1(X2)
& op1(X2,op1(X2,X1)) != X1
& op1(X1,op1(X2,X1)) = X2 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax3) ).
fof(ax2,axiom,
! [X1] :
( sorti2(X1)
=> ! [X2] :
( sorti2(X2)
=> sorti2(op2(X1,X2)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax2) ).
fof(ax1,axiom,
! [X1] :
( sorti1(X1)
=> ! [X2] :
( sorti1(X2)
=> sorti1(op1(X1,X2)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax1) ).
fof(c_0_5,negated_conjecture,
~ ( ( ! [X1] :
( sorti1(X1)
=> sorti2(h(X1)) )
& ! [X2] :
( sorti2(X2)
=> sorti1(j(X2)) ) )
=> ~ ( ! [X3] :
( sorti1(X3)
=> ! [X4] :
( sorti1(X4)
=> h(op1(X3,X4)) = op2(h(X3),h(X4)) ) )
& ! [X5] :
( sorti2(X5)
=> ! [X6] :
( sorti2(X6)
=> j(op2(X5,X6)) = op1(j(X5),j(X6)) ) )
& ! [X7] :
( sorti2(X7)
=> h(j(X7)) = X7 )
& ! [X8] :
( sorti1(X8)
=> j(h(X8)) = X8 ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_6,plain,
~ ! [X1] :
( sorti2(X1)
=> ? [X2] :
( sorti2(X2)
& op2(X2,op2(X2,X1)) != X1
& op2(X1,op2(X2,X1)) = X2 ) ),
inference(fof_simplification,[status(thm)],[ax4]) ).
fof(c_0_7,negated_conjecture,
! [X17,X18,X19,X20,X21,X22,X23,X24] :
( ( ~ sorti1(X17)
| sorti2(h(X17)) )
& ( ~ sorti2(X18)
| sorti1(j(X18)) )
& ( ~ sorti1(X19)
| ~ sorti1(X20)
| h(op1(X19,X20)) = op2(h(X19),h(X20)) )
& ( ~ sorti2(X21)
| ~ sorti2(X22)
| j(op2(X21,X22)) = op1(j(X21),j(X22)) )
& ( ~ sorti2(X23)
| h(j(X23)) = X23 )
& ( ~ sorti1(X24)
| j(h(X24)) = X24 ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])]) ).
fof(c_0_8,plain,
! [X16] :
( sorti2(esk2_0)
& ( ~ sorti2(X16)
| op2(X16,op2(X16,esk2_0)) = esk2_0
| op2(esk2_0,op2(X16,esk2_0)) != X16 ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])])]) ).
fof(c_0_9,plain,
! [X1] :
( sorti1(X1)
=> ? [X2] :
( sorti1(X2)
& op1(X2,op1(X2,X1)) != X1
& op1(X1,op1(X2,X1)) = X2 ) ),
inference(fof_simplification,[status(thm)],[ax3]) ).
cnf(c_0_10,negated_conjecture,
( sorti1(j(X1))
| ~ sorti2(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
sorti2(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,negated_conjecture,
( h(j(X1)) = X1
| ~ sorti2(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_13,plain,
! [X11,X12] :
( ~ sorti2(X11)
| ~ sorti2(X12)
| sorti2(op2(X11,X12)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax2])])])]) ).
cnf(c_0_14,negated_conjecture,
( j(op2(X1,X2)) = op1(j(X1),j(X2))
| ~ sorti2(X1)
| ~ sorti2(X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_15,plain,
! [X13] :
( ( sorti1(esk1_1(X13))
| ~ sorti1(X13) )
& ( op1(esk1_1(X13),op1(esk1_1(X13),X13)) != X13
| ~ sorti1(X13) )
& ( op1(X13,op1(esk1_1(X13),X13)) = esk1_1(X13)
| ~ sorti1(X13) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])])]) ).
cnf(c_0_16,negated_conjecture,
( h(op1(X1,X2)) = op2(h(X1),h(X2))
| ~ sorti1(X1)
| ~ sorti1(X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_17,negated_conjecture,
sorti1(j(esk2_0)),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_18,negated_conjecture,
h(j(esk2_0)) = esk2_0,
inference(spm,[status(thm)],[c_0_12,c_0_11]) ).
cnf(c_0_19,plain,
( sorti2(op2(X1,X2))
| ~ sorti2(X1)
| ~ sorti2(X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,negated_conjecture,
( op1(j(X1),j(esk2_0)) = j(op2(X1,esk2_0))
| ~ sorti2(X1) ),
inference(spm,[status(thm)],[c_0_14,c_0_11]) ).
cnf(c_0_21,negated_conjecture,
( sorti2(h(X1))
| ~ sorti1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_22,negated_conjecture,
( j(h(X1)) = X1
| ~ sorti1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_23,plain,
( sorti1(esk1_1(X1))
| ~ sorti1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_24,negated_conjecture,
( h(op1(X1,j(esk2_0))) = op2(h(X1),esk2_0)
| ~ sorti1(X1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]) ).
cnf(c_0_25,negated_conjecture,
( sorti1(j(op2(X1,X2)))
| ~ sorti2(X2)
| ~ sorti2(X1) ),
inference(spm,[status(thm)],[c_0_10,c_0_19]) ).
cnf(c_0_26,negated_conjecture,
( op1(j(h(X1)),j(esk2_0)) = j(op2(h(X1),esk2_0))
| ~ sorti1(X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_27,negated_conjecture,
( j(h(esk1_1(X1))) = esk1_1(X1)
| ~ sorti1(X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_28,negated_conjecture,
( h(op1(esk1_1(X1),j(esk2_0))) = op2(h(esk1_1(X1)),esk2_0)
| ~ sorti1(X1) ),
inference(spm,[status(thm)],[c_0_24,c_0_23]) ).
cnf(c_0_29,negated_conjecture,
( sorti1(j(h(X1)))
| ~ sorti1(X1) ),
inference(spm,[status(thm)],[c_0_10,c_0_21]) ).
cnf(c_0_30,negated_conjecture,
( sorti1(j(op2(X1,esk2_0)))
| ~ sorti2(X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_11]) ).
cnf(c_0_31,negated_conjecture,
( op1(j(h(esk1_1(X1))),j(esk2_0)) = j(op2(h(esk1_1(X1)),esk2_0))
| ~ sorti1(X1) ),
inference(spm,[status(thm)],[c_0_26,c_0_23]) ).
cnf(c_0_32,negated_conjecture,
j(h(esk1_1(j(esk2_0)))) = esk1_1(j(esk2_0)),
inference(spm,[status(thm)],[c_0_27,c_0_17]) ).
cnf(c_0_33,negated_conjecture,
h(op1(esk1_1(j(esk2_0)),j(esk2_0))) = op2(h(esk1_1(j(esk2_0))),esk2_0),
inference(spm,[status(thm)],[c_0_28,c_0_17]) ).
cnf(c_0_34,negated_conjecture,
( op2(h(X1),h(j(h(X2)))) = h(op1(X1,j(h(X2))))
| ~ sorti1(X1)
| ~ sorti1(X2) ),
inference(spm,[status(thm)],[c_0_16,c_0_29]) ).
cnf(c_0_35,negated_conjecture,
( sorti1(j(op2(h(X1),esk2_0)))
| ~ sorti1(X1) ),
inference(spm,[status(thm)],[c_0_30,c_0_21]) ).
cnf(c_0_36,negated_conjecture,
j(op2(h(esk1_1(j(esk2_0))),esk2_0)) = op1(esk1_1(j(esk2_0)),j(esk2_0)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_17]),c_0_32]) ).
cnf(c_0_37,plain,
( op1(X1,op1(esk1_1(X1),X1)) = esk1_1(X1)
| ~ sorti1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_38,negated_conjecture,
( sorti2(op2(h(esk1_1(j(esk2_0))),esk2_0))
| ~ sorti1(op1(esk1_1(j(esk2_0)),j(esk2_0))) ),
inference(spm,[status(thm)],[c_0_21,c_0_33]) ).
fof(c_0_39,plain,
! [X9,X10] :
( ~ sorti1(X9)
| ~ sorti1(X10)
| sorti1(op1(X9,X10)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax1])])])]) ).
cnf(c_0_40,negated_conjecture,
( h(op1(j(esk2_0),j(h(X1)))) = op2(esk2_0,h(j(h(X1))))
| ~ sorti1(X1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_17]),c_0_18]) ).
cnf(c_0_41,negated_conjecture,
( sorti1(op1(esk1_1(j(esk2_0)),j(esk2_0)))
| ~ sorti1(esk1_1(j(esk2_0))) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_42,negated_conjecture,
op1(j(esk2_0),op1(esk1_1(j(esk2_0)),j(esk2_0))) = esk1_1(j(esk2_0)),
inference(spm,[status(thm)],[c_0_37,c_0_17]) ).
cnf(c_0_43,negated_conjecture,
( sorti1(j(op2(X1,op2(h(esk1_1(j(esk2_0))),esk2_0))))
| ~ sorti2(X1)
| ~ sorti1(op1(esk1_1(j(esk2_0)),j(esk2_0))) ),
inference(spm,[status(thm)],[c_0_25,c_0_38]) ).
cnf(c_0_44,plain,
( sorti1(op1(X1,X2))
| ~ sorti1(X1)
| ~ sorti1(X2) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_45,negated_conjecture,
( op2(esk2_0,op2(h(esk1_1(j(esk2_0))),esk2_0)) = h(esk1_1(j(esk2_0)))
| ~ sorti1(esk1_1(j(esk2_0))) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_33]),c_0_36]),c_0_42]),c_0_33]),c_0_36]),c_0_33]) ).
cnf(c_0_46,negated_conjecture,
( sorti1(j(op2(X1,op2(h(esk1_1(j(esk2_0))),esk2_0))))
| ~ sorti2(X1)
| ~ sorti1(esk1_1(j(esk2_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_17])]) ).
cnf(c_0_47,negated_conjecture,
op2(esk2_0,op2(h(esk1_1(j(esk2_0))),esk2_0)) = h(esk1_1(j(esk2_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_23]),c_0_17])]) ).
cnf(c_0_48,negated_conjecture,
( sorti1(j(op2(X1,op2(h(esk1_1(j(esk2_0))),esk2_0))))
| ~ sorti2(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_23]),c_0_17])]) ).
cnf(c_0_49,negated_conjecture,
( sorti2(h(esk1_1(j(esk2_0))))
| ~ sorti2(op2(h(esk1_1(j(esk2_0))),esk2_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_47]),c_0_11])]) ).
cnf(c_0_50,negated_conjecture,
sorti1(esk1_1(j(esk2_0))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_11]),c_0_47]),c_0_32]) ).
cnf(c_0_51,plain,
( op2(X1,op2(X1,esk2_0)) = esk2_0
| ~ sorti2(X1)
| op2(esk2_0,op2(X1,esk2_0)) != X1 ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_52,negated_conjecture,
( sorti2(h(esk1_1(j(esk2_0))))
| ~ sorti1(op1(esk1_1(j(esk2_0)),j(esk2_0))) ),
inference(spm,[status(thm)],[c_0_49,c_0_38]) ).
cnf(c_0_53,negated_conjecture,
sorti1(op1(esk1_1(j(esk2_0)),j(esk2_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_41,c_0_50])]) ).
cnf(c_0_54,negated_conjecture,
( op2(h(esk1_1(j(esk2_0))),op2(h(esk1_1(j(esk2_0))),esk2_0)) = esk2_0
| ~ sorti2(h(esk1_1(j(esk2_0)))) ),
inference(spm,[status(thm)],[c_0_51,c_0_47]) ).
cnf(c_0_55,negated_conjecture,
( op1(j(X1),j(h(X2))) = j(op2(X1,h(X2)))
| ~ sorti2(X1)
| ~ sorti1(X2) ),
inference(spm,[status(thm)],[c_0_14,c_0_21]) ).
cnf(c_0_56,negated_conjecture,
sorti2(h(esk1_1(j(esk2_0)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_52,c_0_53])]) ).
cnf(c_0_57,negated_conjecture,
( op2(h(esk1_1(j(esk2_0))),op2(h(esk1_1(j(esk2_0))),esk2_0)) = esk2_0
| ~ sorti1(esk1_1(j(esk2_0))) ),
inference(spm,[status(thm)],[c_0_54,c_0_21]) ).
cnf(c_0_58,negated_conjecture,
( j(op2(h(esk1_1(j(esk2_0))),h(X1))) = op1(esk1_1(j(esk2_0)),j(h(X1)))
| ~ sorti1(X1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_32]) ).
cnf(c_0_59,negated_conjecture,
op2(h(esk1_1(j(esk2_0))),op2(h(esk1_1(j(esk2_0))),esk2_0)) = esk2_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_23]),c_0_17])]) ).
cnf(c_0_60,plain,
( op1(esk1_1(X1),op1(esk1_1(X1),X1)) != X1
| ~ sorti1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_61,negated_conjecture,
op1(esk1_1(j(esk2_0)),op1(esk1_1(j(esk2_0)),j(esk2_0))) = j(esk2_0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_53]),c_0_33]),c_0_59]),c_0_33]),c_0_36]) ).
cnf(c_0_62,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_17])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : ALG071+1 : TPTP v8.2.0. Released v2.7.0.
% 0.04/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n018.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Sat May 18 22:55:08 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.21/0.48 Running first-order model finding
% 0.21/0.48 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
% 30.74/4.37 # Version: 3.1.0
% 30.74/4.37 # Preprocessing class: FSMSSMSSSSSNFFN.
% 30.74/4.37 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 30.74/4.37 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 30.74/4.37 # Starting new_bool_3 with 300s (1) cores
% 30.74/4.37 # Starting new_bool_1 with 300s (1) cores
% 30.74/4.37 # Starting sh5l with 300s (1) cores
% 30.74/4.37 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 25966 completed with status 0
% 30.74/4.37 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 30.74/4.37 # Preprocessing class: FSMSSMSSSSSNFFN.
% 30.74/4.37 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 30.74/4.37 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 30.74/4.37 # No SInE strategy applied
% 30.74/4.37 # Search class: FHHSF-FFSF21-MFFFFFNN
% 30.74/4.37 # partial match(1): FHHSM-FFSF21-MFFFFFNN
% 30.74/4.37 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 30.74/4.37 # Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0Y with 811s (1) cores
% 30.74/4.37 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 30.74/4.37 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S059I with 136s (1) cores
% 30.74/4.37 # Starting new_bool_3 with 136s (1) cores
% 30.74/4.37 # Starting new_bool_1 with 136s (1) cores
% 30.74/4.37 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S059I with pid 25975 completed with status 0
% 30.74/4.37 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S059I
% 30.74/4.37 # Preprocessing class: FSMSSMSSSSSNFFN.
% 30.74/4.37 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 30.74/4.37 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 30.74/4.37 # No SInE strategy applied
% 30.74/4.37 # Search class: FHHSF-FFSF21-MFFFFFNN
% 30.74/4.37 # partial match(1): FHHSM-FFSF21-MFFFFFNN
% 30.74/4.37 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 30.74/4.37 # Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0Y with 811s (1) cores
% 30.74/4.37 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 30.74/4.37 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S059I with 136s (1) cores
% 30.74/4.37 # Preprocessing time : 0.001 s
% 30.74/4.37 # Presaturation interreduction done
% 30.74/4.37
% 30.74/4.37 # Proof found!
% 30.74/4.37 # SZS status Theorem
% 30.74/4.37 # SZS output start CNFRefutation
% See solution above
% 30.74/4.37 # Parsed axioms : 5
% 30.74/4.37 # Removed by relevancy pruning/SinE : 0
% 30.74/4.37 # Initial clauses : 13
% 30.74/4.37 # Removed in clause preprocessing : 0
% 30.74/4.37 # Initial clauses in saturation : 13
% 30.74/4.37 # Processed clauses : 4126
% 30.74/4.37 # ...of these trivial : 311
% 30.74/4.37 # ...subsumed : 400
% 30.74/4.37 # ...remaining for further processing : 3415
% 30.74/4.37 # Other redundant clauses eliminated : 0
% 30.74/4.37 # Clauses deleted for lack of memory : 0
% 30.74/4.37 # Backward-subsumed : 2
% 30.74/4.37 # Backward-rewritten : 22
% 30.74/4.37 # Generated clauses : 191275
% 30.74/4.37 # ...of the previous two non-redundant : 186402
% 30.74/4.37 # ...aggressively subsumed : 0
% 30.74/4.37 # Contextual simplify-reflections : 0
% 30.74/4.37 # Paramodulations : 191275
% 30.74/4.37 # Factorizations : 0
% 30.74/4.37 # NegExts : 0
% 30.74/4.37 # Equation resolutions : 0
% 30.74/4.37 # Disequality decompositions : 0
% 30.74/4.37 # Total rewrite steps : 178743
% 30.74/4.37 # ...of those cached : 178632
% 30.74/4.37 # Propositional unsat checks : 0
% 30.74/4.37 # Propositional check models : 0
% 30.74/4.37 # Propositional check unsatisfiable : 0
% 30.74/4.37 # Propositional clauses : 0
% 30.74/4.37 # Propositional clauses after purity: 0
% 30.74/4.37 # Propositional unsat core size : 0
% 30.74/4.37 # Propositional preprocessing time : 0.000
% 30.74/4.37 # Propositional encoding time : 0.000
% 30.74/4.37 # Propositional solver time : 0.000
% 30.74/4.37 # Success case prop preproc time : 0.000
% 30.74/4.37 # Success case prop encoding time : 0.000
% 30.74/4.37 # Success case prop solver time : 0.000
% 30.74/4.37 # Current number of processed clauses : 3378
% 30.74/4.37 # Positive orientable unit clauses : 117
% 30.74/4.37 # Positive unorientable unit clauses: 0
% 30.74/4.37 # Negative unit clauses : 0
% 30.74/4.37 # Non-unit-clauses : 3261
% 30.74/4.37 # Current number of unprocessed clauses: 182302
% 30.74/4.37 # ...number of literals in the above : 370426
% 30.74/4.37 # Current number of archived formulas : 0
% 30.74/4.37 # Current number of archived clauses : 37
% 30.74/4.37 # Clause-clause subsumption calls (NU) : 401651
% 30.74/4.37 # Rec. Clause-clause subsumption calls : 366698
% 30.74/4.37 # Non-unit clause-clause subsumptions : 402
% 30.74/4.37 # Unit Clause-clause subsumption calls : 819
% 30.74/4.37 # Rewrite failures with RHS unbound : 0
% 30.74/4.37 # BW rewrite match attempts : 14465
% 30.74/4.37 # BW rewrite match successes : 16
% 30.74/4.37 # Condensation attempts : 0
% 30.74/4.37 # Condensation successes : 0
% 30.74/4.37 # Termbank termtop insertions : 7603422
% 30.74/4.37 # Search garbage collected termcells : 368
% 30.74/4.37
% 30.74/4.37 # -------------------------------------------------
% 30.74/4.37 # User time : 3.644 s
% 30.74/4.37 # System time : 0.144 s
% 30.74/4.37 # Total time : 3.787 s
% 30.74/4.37 # Maximum resident set size: 1772 pages
% 30.74/4.37
% 30.74/4.37 # -------------------------------------------------
% 30.74/4.37 # User time : 18.643 s
% 30.74/4.37 # System time : 0.405 s
% 30.74/4.37 # Total time : 19.049 s
% 30.74/4.37 # Maximum resident set size: 1696 pages
% 30.74/4.37 % E---3.1 exiting
%------------------------------------------------------------------------------