TSTP Solution File: LCL518+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : LCL518+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n015.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 18:13:00 EDT 2023
% Result : Theorem 0.17s 0.47s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 18
% Syntax : Number of formulae : 82 ( 45 unt; 0 def)
% Number of atoms : 141 ( 22 equ)
% Maximal formula atoms : 10 ( 1 avg)
% Number of connectives : 101 ( 42 ~; 41 |; 8 &)
% ( 5 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 2 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 12 ( 10 usr; 10 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 9 con; 0-2 aty)
% Number of variables : 116 ( 6 sgn; 34 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(op_implies_or,axiom,
( op_implies_or
=> ! [X1,X2] : implies(X1,X2) = or(not(X1),X2) ),
file('/export/starexec/sandbox/tmp/tmp.HPKrg1pveB/E---3.1_24960.p',op_implies_or) ).
fof(op_implies_and,axiom,
( op_implies_and
=> ! [X1,X2] : implies(X1,X2) = not(and(X1,not(X2))) ),
file('/export/starexec/sandbox/tmp/tmp.HPKrg1pveB/E---3.1_24960.p',op_implies_and) ).
fof(op_and,axiom,
( op_and
=> ! [X1,X2] : and(X1,X2) = not(or(not(X1),not(X2))) ),
file('/export/starexec/sandbox/tmp/tmp.HPKrg1pveB/E---3.1_24960.p',op_and) ).
fof(principia_op_implies_or,axiom,
op_implies_or,
file('/export/starexec/sandbox/tmp/tmp.HPKrg1pveB/E---3.1_24960.p',principia_op_implies_or) ).
fof(rosser_op_implies_and,axiom,
op_implies_and,
file('/export/starexec/sandbox/tmp/tmp.HPKrg1pveB/E---3.1_24960.p',rosser_op_implies_and) ).
fof(principia_op_and,axiom,
op_and,
file('/export/starexec/sandbox/tmp/tmp.HPKrg1pveB/E---3.1_24960.p',principia_op_and) ).
fof(kn2,axiom,
( kn2
<=> ! [X4,X5] : is_a_theorem(implies(and(X4,X5),X4)) ),
file('/export/starexec/sandbox/tmp/tmp.HPKrg1pveB/E---3.1_24960.p',kn2) ).
fof(op_or,axiom,
( op_or
=> ! [X1,X2] : or(X1,X2) = not(and(not(X1),not(X2))) ),
file('/export/starexec/sandbox/tmp/tmp.HPKrg1pveB/E---3.1_24960.p',op_or) ).
fof(modus_ponens,axiom,
( modus_ponens
<=> ! [X1,X2] :
( ( is_a_theorem(X1)
& is_a_theorem(implies(X1,X2)) )
=> is_a_theorem(X2) ) ),
file('/export/starexec/sandbox/tmp/tmp.HPKrg1pveB/E---3.1_24960.p',modus_ponens) ).
fof(rosser_kn2,axiom,
kn2,
file('/export/starexec/sandbox/tmp/tmp.HPKrg1pveB/E---3.1_24960.p',rosser_kn2) ).
fof(rosser_op_or,axiom,
op_or,
file('/export/starexec/sandbox/tmp/tmp.HPKrg1pveB/E---3.1_24960.p',rosser_op_or) ).
fof(kn1,axiom,
( kn1
<=> ! [X4] : is_a_theorem(implies(X4,and(X4,X4))) ),
file('/export/starexec/sandbox/tmp/tmp.HPKrg1pveB/E---3.1_24960.p',kn1) ).
fof(rosser_modus_ponens,axiom,
modus_ponens,
file('/export/starexec/sandbox/tmp/tmp.HPKrg1pveB/E---3.1_24960.p',rosser_modus_ponens) ).
fof(rosser_kn1,axiom,
kn1,
file('/export/starexec/sandbox/tmp/tmp.HPKrg1pveB/E---3.1_24960.p',rosser_kn1) ).
fof(kn3,axiom,
( kn3
<=> ! [X4,X5,X6] : is_a_theorem(implies(implies(X4,X5),implies(not(and(X5,X6)),not(and(X6,X4))))) ),
file('/export/starexec/sandbox/tmp/tmp.HPKrg1pveB/E---3.1_24960.p',kn3) ).
fof(rosser_kn3,axiom,
kn3,
file('/export/starexec/sandbox/tmp/tmp.HPKrg1pveB/E---3.1_24960.p',rosser_kn3) ).
fof(r1,axiom,
( r1
<=> ! [X4] : is_a_theorem(implies(or(X4,X4),X4)) ),
file('/export/starexec/sandbox/tmp/tmp.HPKrg1pveB/E---3.1_24960.p',r1) ).
fof(principia_r1,conjecture,
r1,
file('/export/starexec/sandbox/tmp/tmp.HPKrg1pveB/E---3.1_24960.p',principia_r1) ).
fof(c_0_18,plain,
! [X123,X124] :
( ~ op_implies_or
| implies(X123,X124) = or(not(X123),X124) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[op_implies_or])])]) ).
fof(c_0_19,plain,
! [X121,X122] :
( ~ op_implies_and
| implies(X121,X122) = not(and(X121,not(X122))) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[op_implies_and])])]) ).
fof(c_0_20,plain,
! [X119,X120] :
( ~ op_and
| and(X119,X120) = not(or(not(X119),not(X120))) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[op_and])])]) ).
cnf(c_0_21,plain,
( implies(X1,X2) = or(not(X1),X2)
| ~ op_implies_or ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_22,plain,
op_implies_or,
inference(split_conjunct,[status(thm)],[principia_op_implies_or]) ).
cnf(c_0_23,plain,
( implies(X1,X2) = not(and(X1,not(X2)))
| ~ op_implies_and ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_24,plain,
op_implies_and,
inference(split_conjunct,[status(thm)],[rosser_op_implies_and]) ).
cnf(c_0_25,plain,
( and(X1,X2) = not(or(not(X1),not(X2)))
| ~ op_and ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_26,plain,
or(not(X1),X2) = implies(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22])]) ).
cnf(c_0_27,plain,
op_and,
inference(split_conjunct,[status(thm)],[principia_op_and]) ).
fof(c_0_28,plain,
! [X73,X74] :
( ( ~ kn2
| is_a_theorem(implies(and(X73,X74),X73)) )
& ( ~ is_a_theorem(implies(and(esk34_0,esk35_0),esk34_0))
| kn2 ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kn2])])])]) ).
fof(c_0_29,plain,
! [X117,X118] :
( ~ op_or
| or(X117,X118) = not(and(not(X117),not(X118))) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[op_or])])]) ).
cnf(c_0_30,plain,
not(and(X1,not(X2))) = implies(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24])]) ).
cnf(c_0_31,plain,
and(X1,X2) = not(implies(X1,not(X2))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_26]),c_0_27])]) ).
fof(c_0_32,plain,
! [X7,X8] :
( ( ~ modus_ponens
| ~ is_a_theorem(X7)
| ~ is_a_theorem(implies(X7,X8))
| is_a_theorem(X8) )
& ( is_a_theorem(esk1_0)
| modus_ponens )
& ( is_a_theorem(implies(esk1_0,esk2_0))
| modus_ponens )
& ( ~ is_a_theorem(esk2_0)
| modus_ponens ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[modus_ponens])])])])]) ).
cnf(c_0_33,plain,
( is_a_theorem(implies(and(X1,X2),X1))
| ~ kn2 ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_34,plain,
kn2,
inference(split_conjunct,[status(thm)],[rosser_kn2]) ).
cnf(c_0_35,plain,
( or(X1,X2) = not(and(not(X1),not(X2)))
| ~ op_or ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_36,plain,
not(not(implies(X1,not(not(X2))))) = implies(X1,X2),
inference(rw,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_37,plain,
op_or,
inference(split_conjunct,[status(thm)],[rosser_op_or]) ).
fof(c_0_38,plain,
! [X71] :
( ( ~ kn1
| is_a_theorem(implies(X71,and(X71,X71))) )
& ( ~ is_a_theorem(implies(esk33_0,and(esk33_0,esk33_0)))
| kn1 ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kn1])])])]) ).
cnf(c_0_39,plain,
( is_a_theorem(X2)
| ~ modus_ponens
| ~ is_a_theorem(X1)
| ~ is_a_theorem(implies(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_40,plain,
modus_ponens,
inference(split_conjunct,[status(thm)],[rosser_modus_ponens]) ).
cnf(c_0_41,plain,
is_a_theorem(implies(and(X1,X2),X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_34])]) ).
cnf(c_0_42,plain,
or(X1,X2) = implies(not(X1),X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_31]),c_0_36]),c_0_37])]) ).
cnf(c_0_43,plain,
or(implies(X1,X2),X3) = implies(not(implies(X1,not(not(X2)))),X3),
inference(spm,[status(thm)],[c_0_26,c_0_36]) ).
cnf(c_0_44,plain,
( is_a_theorem(implies(X1,and(X1,X1)))
| ~ kn1 ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_45,plain,
kn1,
inference(split_conjunct,[status(thm)],[rosser_kn1]) ).
cnf(c_0_46,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(implies(X2,X1))
| ~ is_a_theorem(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_40])]) ).
cnf(c_0_47,plain,
is_a_theorem(or(implies(X1,not(X2)),X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_41,c_0_31]),c_0_42]) ).
cnf(c_0_48,plain,
or(implies(X1,not(not(X2))),X3) = or(implies(X1,X2),X3),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_49,plain,
is_a_theorem(implies(X1,and(X1,X1))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_44,c_0_45])]) ).
fof(c_0_50,plain,
! [X77,X78,X79] :
( ( ~ kn3
| is_a_theorem(implies(implies(X77,X78),implies(not(and(X78,X79)),not(and(X79,X77))))) )
& ( ~ is_a_theorem(implies(implies(esk36_0,esk37_0),implies(not(and(esk37_0,esk38_0)),not(and(esk38_0,esk36_0)))))
| kn3 ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kn3])])])]) ).
cnf(c_0_51,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(or(X2,X1))
| ~ is_a_theorem(not(X2)) ),
inference(spm,[status(thm)],[c_0_46,c_0_42]) ).
cnf(c_0_52,plain,
is_a_theorem(or(implies(X1,X2),X1)),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_53,plain,
( is_a_theorem(not(implies(X1,not(X1))))
| ~ is_a_theorem(X1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_49]),c_0_31]) ).
cnf(c_0_54,plain,
implies(not(not(X1)),X2) = implies(X1,X2),
inference(spm,[status(thm)],[c_0_26,c_0_42]) ).
cnf(c_0_55,plain,
( is_a_theorem(implies(implies(X1,X2),implies(not(and(X2,X3)),not(and(X3,X1)))))
| ~ kn3 ),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_56,plain,
kn3,
inference(split_conjunct,[status(thm)],[rosser_kn3]) ).
cnf(c_0_57,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(not(implies(X1,X2))) ),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_58,plain,
( is_a_theorem(not(implies(X1,not(not(not(X1))))))
| ~ is_a_theorem(not(not(X1))) ),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_59,plain,
is_a_theorem(implies(implies(X1,X2),implies(not(not(implies(X2,not(X3)))),not(not(implies(X3,not(X1))))))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_55,c_0_31]),c_0_31]),c_0_56])]) ).
cnf(c_0_60,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(not(not(X1))) ),
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_61,plain,
not(not(or(X1,not(not(X2))))) = implies(not(X1),X2),
inference(spm,[status(thm)],[c_0_36,c_0_42]) ).
cnf(c_0_62,plain,
is_a_theorem(implies(implies(X1,X2),implies(implies(X2,not(X3)),not(not(implies(X3,not(X1))))))),
inference(rw,[status(thm)],[c_0_59,c_0_54]) ).
cnf(c_0_63,plain,
( is_a_theorem(or(X1,not(not(X2))))
| ~ is_a_theorem(implies(not(X1),X2)) ),
inference(spm,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_64,plain,
( is_a_theorem(implies(implies(X1,not(X2)),not(not(implies(X2,not(X3))))))
| ~ is_a_theorem(implies(X3,X1)) ),
inference(spm,[status(thm)],[c_0_46,c_0_62]) ).
cnf(c_0_65,plain,
is_a_theorem(implies(not(X1),not(or(X1,X1)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_49]),c_0_31]),c_0_36]),c_0_42]),c_0_42]) ).
cnf(c_0_66,plain,
is_a_theorem(implies(implies(not(or(X1,X1)),not(X2)),implies(X2,X1))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_36]) ).
cnf(c_0_67,plain,
implies(implies(X1,not(not(X2))),X3) = implies(implies(X1,X2),X3),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_36]),c_0_26]) ).
cnf(c_0_68,plain,
is_a_theorem(implies(implies(not(or(X1,X1)),X2),or(X2,X1))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_42]),c_0_67]) ).
cnf(c_0_69,plain,
is_a_theorem(implies(or(or(X1,X1),X2),or(X2,X1))),
inference(spm,[status(thm)],[c_0_68,c_0_42]) ).
cnf(c_0_70,plain,
( is_a_theorem(or(X1,X2))
| ~ is_a_theorem(or(or(X2,X2),X1)) ),
inference(spm,[status(thm)],[c_0_46,c_0_69]) ).
cnf(c_0_71,plain,
is_a_theorem(or(or(X1,X2),not(X1))),
inference(spm,[status(thm)],[c_0_52,c_0_42]) ).
fof(c_0_72,plain,
! [X95] :
( ( ~ r1
| is_a_theorem(implies(or(X95,X95),X95)) )
& ( ~ is_a_theorem(implies(or(esk45_0,esk45_0),esk45_0))
| r1 ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[r1])])])]) ).
fof(c_0_73,negated_conjecture,
~ r1,
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[principia_r1])]) ).
cnf(c_0_74,plain,
is_a_theorem(implies(X1,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_71]),c_0_26]) ).
cnf(c_0_75,plain,
( r1
| ~ is_a_theorem(implies(or(esk45_0,esk45_0),esk45_0)) ),
inference(split_conjunct,[status(thm)],[c_0_72]) ).
cnf(c_0_76,negated_conjecture,
~ r1,
inference(split_conjunct,[status(thm)],[c_0_73]) ).
cnf(c_0_77,plain,
( is_a_theorem(or(X1,X2))
| ~ is_a_theorem(implies(not(or(X2,X2)),X1)) ),
inference(spm,[status(thm)],[c_0_46,c_0_68]) ).
cnf(c_0_78,plain,
is_a_theorem(implies(X1,not(not(X1)))),
inference(spm,[status(thm)],[c_0_74,c_0_54]) ).
cnf(c_0_79,plain,
~ is_a_theorem(implies(or(esk45_0,esk45_0),esk45_0)),
inference(sr,[status(thm)],[c_0_75,c_0_76]) ).
cnf(c_0_80,plain,
is_a_theorem(implies(or(X1,X1),X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_78]),c_0_26]),c_0_54]) ).
cnf(c_0_81,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_79,c_0_80])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : LCL518+1 : TPTP v8.1.2. Released v3.3.0.
% 0.06/0.11 % Command : run_E %s %d THM
% 0.11/0.31 % Computer : n015.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 2400
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Mon Oct 2 12:29:46 EDT 2023
% 0.11/0.31 % CPUTime :
% 0.17/0.42 Running first-order theorem proving
% 0.17/0.42 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.HPKrg1pveB/E---3.1_24960.p
% 0.17/0.47 # Version: 3.1pre001
% 0.17/0.47 # Preprocessing class: FSMSSLSSSSSNFFN.
% 0.17/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.47 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 0.17/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.47 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.47 # Starting sh5l with 300s (1) cores
% 0.17/0.47 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with pid 25038 completed with status 0
% 0.17/0.47 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI
% 0.17/0.47 # Preprocessing class: FSMSSLSSSSSNFFN.
% 0.17/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.47 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 0.17/0.47 # No SInE strategy applied
% 0.17/0.47 # Search class: FGUSF-FFMM21-MFFFFFNN
% 0.17/0.47 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.47 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 750s (1) cores
% 0.17/0.47 # Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI with 151s (1) cores
% 0.17/0.47 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 151s (1) cores
% 0.17/0.47 # Starting U----_207d_00_B07_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.17/0.47 # Starting G-E--_208_C09_12_F1_SE_CS_SP_PS_S5PRR_S04AN with 151s (1) cores
% 0.17/0.47 # U----_207d_00_B07_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with pid 25051 completed with status 0
% 0.17/0.47 # Result found by U----_207d_00_B07_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN
% 0.17/0.47 # Preprocessing class: FSMSSLSSSSSNFFN.
% 0.17/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.47 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 0.17/0.47 # No SInE strategy applied
% 0.17/0.47 # Search class: FGUSF-FFMM21-MFFFFFNN
% 0.17/0.47 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.47 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 750s (1) cores
% 0.17/0.47 # Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI with 151s (1) cores
% 0.17/0.47 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 151s (1) cores
% 0.17/0.47 # Starting U----_207d_00_B07_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.17/0.47 # Preprocessing time : 0.004 s
% 0.17/0.47 # Presaturation interreduction done
% 0.17/0.47
% 0.17/0.47 # Proof found!
% 0.17/0.47 # SZS status Theorem
% 0.17/0.47 # SZS output start CNFRefutation
% See solution above
% 0.17/0.47 # Parsed axioms : 43
% 0.17/0.47 # Removed by relevancy pruning/SinE : 0
% 0.17/0.47 # Initial clauses : 72
% 0.17/0.47 # Removed in clause preprocessing : 0
% 0.17/0.47 # Initial clauses in saturation : 72
% 0.17/0.47 # Processed clauses : 375
% 0.17/0.47 # ...of these trivial : 52
% 0.17/0.47 # ...subsumed : 93
% 0.17/0.47 # ...remaining for further processing : 230
% 0.17/0.47 # Other redundant clauses eliminated : 0
% 0.17/0.47 # Clauses deleted for lack of memory : 0
% 0.17/0.47 # Backward-subsumed : 1
% 0.17/0.47 # Backward-rewritten : 22
% 0.17/0.47 # Generated clauses : 2068
% 0.17/0.47 # ...of the previous two non-redundant : 1693
% 0.17/0.47 # ...aggressively subsumed : 0
% 0.17/0.47 # Contextual simplify-reflections : 0
% 0.17/0.47 # Paramodulations : 2068
% 0.17/0.47 # Factorizations : 0
% 0.17/0.47 # NegExts : 0
% 0.17/0.47 # Equation resolutions : 0
% 0.17/0.47 # Total rewrite steps : 1678
% 0.17/0.47 # Propositional unsat checks : 0
% 0.17/0.47 # Propositional check models : 0
% 0.17/0.47 # Propositional check unsatisfiable : 0
% 0.17/0.47 # Propositional clauses : 0
% 0.17/0.47 # Propositional clauses after purity: 0
% 0.17/0.47 # Propositional unsat core size : 0
% 0.17/0.47 # Propositional preprocessing time : 0.000
% 0.17/0.47 # Propositional encoding time : 0.000
% 0.17/0.47 # Propositional solver time : 0.000
% 0.17/0.47 # Success case prop preproc time : 0.000
% 0.17/0.47 # Success case prop encoding time : 0.000
% 0.17/0.47 # Success case prop solver time : 0.000
% 0.17/0.47 # Current number of processed clauses : 146
% 0.17/0.47 # Positive orientable unit clauses : 69
% 0.17/0.47 # Positive unorientable unit clauses: 2
% 0.17/0.47 # Negative unit clauses : 1
% 0.17/0.47 # Non-unit-clauses : 74
% 0.17/0.47 # Current number of unprocessed clauses: 1414
% 0.17/0.47 # ...number of literals in the above : 1928
% 0.17/0.47 # Current number of archived formulas : 0
% 0.17/0.47 # Current number of archived clauses : 84
% 0.17/0.47 # Clause-clause subsumption calls (NU) : 495
% 0.17/0.47 # Rec. Clause-clause subsumption calls : 495
% 0.17/0.47 # Non-unit clause-clause subsumptions : 58
% 0.17/0.47 # Unit Clause-clause subsumption calls : 144
% 0.17/0.47 # Rewrite failures with RHS unbound : 0
% 0.17/0.47 # BW rewrite match attempts : 417
% 0.17/0.47 # BW rewrite match successes : 40
% 0.17/0.47 # Condensation attempts : 0
% 0.17/0.47 # Condensation successes : 0
% 0.17/0.47 # Termbank termtop insertions : 35939
% 0.17/0.47
% 0.17/0.47 # -------------------------------------------------
% 0.17/0.47 # User time : 0.036 s
% 0.17/0.47 # System time : 0.006 s
% 0.17/0.47 # Total time : 0.042 s
% 0.17/0.47 # Maximum resident set size: 1952 pages
% 0.17/0.47
% 0.17/0.47 # -------------------------------------------------
% 0.17/0.47 # User time : 0.138 s
% 0.17/0.47 # System time : 0.025 s
% 0.17/0.47 # Total time : 0.163 s
% 0.17/0.47 # Maximum resident set size: 1724 pages
% 0.17/0.47 % E---3.1 exiting
% 0.17/0.47 % E---3.1 exiting
%------------------------------------------------------------------------------