TSTP Solution File: LCL497+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : LCL497+1 : TPTP v8.2.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n008.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 23:57:07 EDT 2024
% Result : Theorem 0.18s 0.52s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 18
% Syntax : Number of formulae : 80 ( 37 unt; 0 def)
% Number of atoms : 148 ( 12 equ)
% Maximal formula atoms : 10 ( 1 avg)
% Number of connectives : 119 ( 51 ~; 49 |; 9 &)
% ( 6 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 12 ( 10 usr; 10 prp; 0-2 aty)
% Number of functors : 18 ( 18 usr; 14 con; 0-2 aty)
% Number of variables : 125 ( 9 sgn 40 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
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/sandbox2/benchmark/Axioms/LCL006+0.ax',modus_ponens) ).
fof(r4,axiom,
( r4
<=> ! [X4,X5,X6] : is_a_theorem(implies(or(X4,or(X5,X6)),or(X5,or(X4,X6)))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax',r4) ).
fof(principia_modus_ponens,axiom,
modus_ponens,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+4.ax',principia_modus_ponens) ).
fof(principia_r4,axiom,
r4,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+4.ax',principia_r4) ).
fof(op_implies_or,axiom,
( op_implies_or
=> ! [X1,X2] : implies(X1,X2) = or(not(X1),X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+1.ax',op_implies_or) ).
fof(principia_op_implies_or,axiom,
op_implies_or,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+4.ax',principia_op_implies_or) ).
fof(r2,axiom,
( r2
<=> ! [X4,X5] : is_a_theorem(implies(X5,or(X4,X5))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax',r2) ).
fof(r3,axiom,
( r3
<=> ! [X4,X5] : is_a_theorem(implies(or(X4,X5),or(X5,X4))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax',r3) ).
fof(principia_r2,axiom,
r2,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+4.ax',principia_r2) ).
fof(principia_r3,axiom,
r3,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+4.ax',principia_r3) ).
fof(r5,axiom,
( r5
<=> ! [X4,X5,X6] : is_a_theorem(implies(implies(X5,X6),implies(or(X4,X5),or(X4,X6)))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax',r5) ).
fof(op_and,axiom,
( op_and
=> ! [X1,X2] : and(X1,X2) = not(or(not(X1),not(X2))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+1.ax',op_and) ).
fof(principia_r5,axiom,
r5,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+4.ax',principia_r5) ).
fof(principia_op_and,axiom,
op_and,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+4.ax',principia_op_and) ).
fof(op_or,axiom,
( op_or
=> ! [X1,X2] : or(X1,X2) = not(and(not(X1),not(X2))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+1.ax',op_or) ).
fof(luka_op_or,axiom,
op_or,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',luka_op_or) ).
fof(luka_cn2,conjecture,
cn2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',luka_cn2) ).
fof(cn2,axiom,
( cn2
<=> ! [X4,X5] : is_a_theorem(implies(X4,implies(not(X4),X5))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax',cn2) ).
fof(c_0_18,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(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[modus_ponens])])])])])]) ).
fof(c_0_19,plain,
! [X105,X106,X107] :
( ( ~ r4
| is_a_theorem(implies(or(X105,or(X106,X107)),or(X106,or(X105,X107)))) )
& ( ~ is_a_theorem(implies(or(esk50_0,or(esk51_0,esk52_0)),or(esk51_0,or(esk50_0,esk52_0))))
| r4 ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[r4])])])])]) ).
cnf(c_0_20,plain,
( is_a_theorem(X2)
| ~ modus_ponens
| ~ is_a_theorem(X1)
| ~ is_a_theorem(implies(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_21,plain,
modus_ponens,
inference(split_conjunct,[status(thm)],[principia_modus_ponens]) ).
cnf(c_0_22,plain,
( is_a_theorem(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3))))
| ~ r4 ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_23,plain,
r4,
inference(split_conjunct,[status(thm)],[principia_r4]) ).
fof(c_0_24,plain,
! [X123,X124] :
( ~ op_implies_or
| implies(X123,X124) = or(not(X123),X124) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[op_implies_or])])])]) ).
cnf(c_0_25,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_20,c_0_21])]) ).
cnf(c_0_26,plain,
is_a_theorem(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23])]) ).
cnf(c_0_27,plain,
( implies(X1,X2) = or(not(X1),X2)
| ~ op_implies_or ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_28,plain,
op_implies_or,
inference(split_conjunct,[status(thm)],[principia_op_implies_or]) ).
fof(c_0_29,plain,
! [X97,X98] :
( ( ~ r2
| is_a_theorem(implies(X98,or(X97,X98))) )
& ( ~ is_a_theorem(implies(esk47_0,or(esk46_0,esk47_0)))
| r2 ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[r2])])])])]) ).
fof(c_0_30,plain,
! [X101,X102] :
( ( ~ r3
| is_a_theorem(implies(or(X101,X102),or(X102,X101))) )
& ( ~ is_a_theorem(implies(or(esk48_0,esk49_0),or(esk49_0,esk48_0)))
| r3 ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[r3])])])])]) ).
cnf(c_0_31,plain,
( is_a_theorem(or(X1,or(X2,X3)))
| ~ is_a_theorem(or(X2,or(X1,X3))) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_32,plain,
or(not(X1),X2) = implies(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_28])]) ).
cnf(c_0_33,plain,
( is_a_theorem(implies(X1,or(X2,X1)))
| ~ r2 ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_34,plain,
r2,
inference(split_conjunct,[status(thm)],[principia_r2]) ).
cnf(c_0_35,plain,
( is_a_theorem(implies(or(X1,X2),or(X2,X1)))
| ~ r3 ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_36,plain,
r3,
inference(split_conjunct,[status(thm)],[principia_r3]) ).
cnf(c_0_37,plain,
( is_a_theorem(implies(X1,or(X2,X3)))
| ~ is_a_theorem(or(X2,implies(X1,X3))) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_32]) ).
cnf(c_0_38,plain,
is_a_theorem(implies(X1,or(X2,X1))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_34])]) ).
cnf(c_0_39,plain,
is_a_theorem(implies(or(X1,X2),or(X2,X1))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_36])]) ).
cnf(c_0_40,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(implies(X2,implies(X1,X3))) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_32]),c_0_32]) ).
cnf(c_0_41,plain,
is_a_theorem(implies(X1,implies(X2,X1))),
inference(spm,[status(thm)],[c_0_38,c_0_32]) ).
cnf(c_0_42,plain,
( is_a_theorem(or(X1,X2))
| ~ is_a_theorem(or(X2,X1)) ),
inference(spm,[status(thm)],[c_0_25,c_0_39]) ).
cnf(c_0_43,plain,
is_a_theorem(implies(X1,implies(X2,X2))),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_44,plain,
( is_a_theorem(or(X1,not(X2)))
| ~ is_a_theorem(implies(X2,X1)) ),
inference(spm,[status(thm)],[c_0_42,c_0_32]) ).
cnf(c_0_45,plain,
( is_a_theorem(implies(X1,X1))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_25,c_0_43]) ).
fof(c_0_46,plain,
! [X111,X112,X113] :
( ( ~ r5
| is_a_theorem(implies(implies(X112,X113),implies(or(X111,X112),or(X111,X113)))) )
& ( ~ is_a_theorem(implies(implies(esk54_0,esk55_0),implies(or(esk53_0,esk54_0),or(esk53_0,esk55_0))))
| r5 ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[r5])])])])]) ).
cnf(c_0_47,plain,
( is_a_theorem(implies(X1,not(X2)))
| ~ is_a_theorem(implies(X2,not(X1))) ),
inference(spm,[status(thm)],[c_0_44,c_0_32]) ).
cnf(c_0_48,plain,
is_a_theorem(implies(X1,X1)),
inference(spm,[status(thm)],[c_0_45,c_0_39]) ).
fof(c_0_49,plain,
! [X119,X120] :
( ~ op_and
| and(X119,X120) = not(or(not(X119),not(X120))) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[op_and])])])]) ).
cnf(c_0_50,plain,
( is_a_theorem(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2))))
| ~ r5 ),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_51,plain,
r5,
inference(split_conjunct,[status(thm)],[principia_r5]) ).
cnf(c_0_52,plain,
is_a_theorem(implies(X1,not(not(X1)))),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_53,plain,
( and(X1,X2) = not(or(not(X1),not(X2)))
| ~ op_and ),
inference(split_conjunct,[status(thm)],[c_0_49]) ).
cnf(c_0_54,plain,
op_and,
inference(split_conjunct,[status(thm)],[principia_op_and]) ).
fof(c_0_55,plain,
! [X117,X118] :
( ~ op_or
| or(X117,X118) = not(and(not(X117),not(X118))) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[op_or])])])]) ).
cnf(c_0_56,plain,
is_a_theorem(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_50,c_0_51])]) ).
cnf(c_0_57,plain,
( is_a_theorem(not(not(X1)))
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_52]) ).
cnf(c_0_58,plain,
not(implies(X1,not(X2))) = and(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_53,c_0_32]),c_0_54])]) ).
cnf(c_0_59,plain,
( or(X1,X2) = not(and(not(X1),not(X2)))
| ~ op_or ),
inference(split_conjunct,[status(thm)],[c_0_55]) ).
cnf(c_0_60,plain,
op_or,
inference(split_conjunct,[status(thm)],[luka_op_or]) ).
cnf(c_0_61,plain,
( is_a_theorem(implies(or(X1,X2),or(X1,X3)))
| ~ is_a_theorem(implies(X2,X3)) ),
inference(spm,[status(thm)],[c_0_25,c_0_56]) ).
cnf(c_0_62,plain,
( is_a_theorem(not(and(X1,X2)))
| ~ is_a_theorem(implies(X1,not(X2))) ),
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_63,plain,
not(and(not(X1),not(X2))) = or(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_59,c_0_60])]) ).
cnf(c_0_64,plain,
( is_a_theorem(or(X1,X2))
| ~ is_a_theorem(or(X1,X3))
| ~ is_a_theorem(implies(X3,X2)) ),
inference(spm,[status(thm)],[c_0_25,c_0_61]) ).
cnf(c_0_65,plain,
( is_a_theorem(or(X1,X2))
| ~ is_a_theorem(implies(not(X1),not(not(X2)))) ),
inference(spm,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_66,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X1,X3))
| ~ is_a_theorem(implies(X3,X2)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_32]),c_0_32]) ).
fof(c_0_67,negated_conjecture,
~ cn2,
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[luka_cn2])]) ).
cnf(c_0_68,plain,
is_a_theorem(or(X1,not(X1))),
inference(spm,[status(thm)],[c_0_65,c_0_52]) ).
cnf(c_0_69,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(or(X3,X1),X2)) ),
inference(spm,[status(thm)],[c_0_66,c_0_38]) ).
fof(c_0_70,plain,
! [X89,X90] :
( ( ~ cn2
| is_a_theorem(implies(X89,implies(not(X89),X90))) )
& ( ~ is_a_theorem(implies(esk42_0,implies(not(esk42_0),esk43_0)))
| cn2 ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cn2])])])])]) ).
fof(c_0_71,negated_conjecture,
~ cn2,
inference(fof_nnf,[status(thm)],[c_0_67]) ).
cnf(c_0_72,plain,
( is_a_theorem(or(X1,X2))
| ~ is_a_theorem(implies(not(X1),X2)) ),
inference(spm,[status(thm)],[c_0_64,c_0_68]) ).
cnf(c_0_73,plain,
is_a_theorem(implies(X1,or(X1,X2))),
inference(spm,[status(thm)],[c_0_69,c_0_39]) ).
cnf(c_0_74,plain,
( cn2
| ~ is_a_theorem(implies(esk42_0,implies(not(esk42_0),esk43_0))) ),
inference(split_conjunct,[status(thm)],[c_0_70]) ).
cnf(c_0_75,negated_conjecture,
~ cn2,
inference(split_conjunct,[status(thm)],[c_0_71]) ).
cnf(c_0_76,plain,
is_a_theorem(or(X1,implies(X1,X2))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_73]),c_0_32]) ).
cnf(c_0_77,plain,
~ is_a_theorem(implies(esk42_0,implies(not(esk42_0),esk43_0))),
inference(sr,[status(thm)],[c_0_74,c_0_75]) ).
cnf(c_0_78,plain,
is_a_theorem(implies(X1,implies(not(X1),X2))),
inference(spm,[status(thm)],[c_0_76,c_0_32]) ).
cnf(c_0_79,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_77,c_0_78])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : LCL497+1 : TPTP v8.2.0. Released v3.3.0.
% 0.10/0.13 % Command : run_E %s %d THM
% 0.11/0.33 % Computer : n008.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Mon May 20 00:57:23 EDT 2024
% 0.11/0.33 % CPUTime :
% 0.18/0.46 Running first-order model finding
% 0.18/0.46 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
% 0.18/0.52 # Version: 3.1.0
% 0.18/0.52 # Preprocessing class: FSMSSLSSSSSNFFN.
% 0.18/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.52 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 0.18/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.52 # Starting sh5l with 300s (1) cores
% 0.18/0.52 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with pid 9120 completed with status 0
% 0.18/0.52 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI
% 0.18/0.52 # Preprocessing class: FSMSSLSSSSSNFFN.
% 0.18/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.52 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 0.18/0.52 # No SInE strategy applied
% 0.18/0.52 # Search class: FGUSF-FFMM21-MFFFFFNN
% 0.18/0.52 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.18/0.52 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 750s (1) cores
% 0.18/0.52 # Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI with 151s (1) cores
% 0.18/0.52 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 151s (1) cores
% 0.18/0.52 # Starting U----_207d_00_B07_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.18/0.52 # Starting G-E--_208_C09_12_F1_SE_CS_SP_PS_S5PRR_S04AN with 151s (1) cores
% 0.18/0.52 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with pid 9131 completed with status 0
% 0.18/0.52 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI
% 0.18/0.52 # Preprocessing class: FSMSSLSSSSSNFFN.
% 0.18/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.52 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 0.18/0.52 # No SInE strategy applied
% 0.18/0.52 # Search class: FGUSF-FFMM21-MFFFFFNN
% 0.18/0.52 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.18/0.52 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 750s (1) cores
% 0.18/0.52 # Preprocessing time : 0.003 s
% 0.18/0.52 # Presaturation interreduction done
% 0.18/0.52
% 0.18/0.52 # Proof found!
% 0.18/0.52 # SZS status Theorem
% 0.18/0.52 # SZS output start CNFRefutation
% See solution above
% 0.18/0.52 # Parsed axioms : 45
% 0.18/0.52 # Removed by relevancy pruning/SinE : 0
% 0.18/0.52 # Initial clauses : 74
% 0.18/0.52 # Removed in clause preprocessing : 0
% 0.18/0.52 # Initial clauses in saturation : 74
% 0.18/0.52 # Processed clauses : 678
% 0.18/0.52 # ...of these trivial : 27
% 0.18/0.52 # ...subsumed : 284
% 0.18/0.52 # ...remaining for further processing : 367
% 0.18/0.52 # Other redundant clauses eliminated : 0
% 0.18/0.52 # Clauses deleted for lack of memory : 0
% 0.18/0.52 # Backward-subsumed : 10
% 0.18/0.52 # Backward-rewritten : 14
% 0.18/0.52 # Generated clauses : 2043
% 0.18/0.52 # ...of the previous two non-redundant : 1801
% 0.18/0.52 # ...aggressively subsumed : 0
% 0.18/0.52 # Contextual simplify-reflections : 0
% 0.18/0.52 # Paramodulations : 2043
% 0.18/0.52 # Factorizations : 0
% 0.18/0.52 # NegExts : 0
% 0.18/0.52 # Equation resolutions : 0
% 0.18/0.52 # Disequality decompositions : 0
% 0.18/0.52 # Total rewrite steps : 600
% 0.18/0.52 # ...of those cached : 378
% 0.18/0.52 # Propositional unsat checks : 0
% 0.18/0.52 # Propositional check models : 0
% 0.18/0.52 # Propositional check unsatisfiable : 0
% 0.18/0.52 # Propositional clauses : 0
% 0.18/0.52 # Propositional clauses after purity: 0
% 0.18/0.52 # Propositional unsat core size : 0
% 0.18/0.52 # Propositional preprocessing time : 0.000
% 0.18/0.52 # Propositional encoding time : 0.000
% 0.18/0.52 # Propositional solver time : 0.000
% 0.18/0.52 # Success case prop preproc time : 0.000
% 0.18/0.52 # Success case prop encoding time : 0.000
% 0.18/0.52 # Success case prop solver time : 0.000
% 0.18/0.52 # Current number of processed clauses : 282
% 0.18/0.52 # Positive orientable unit clauses : 70
% 0.18/0.52 # Positive unorientable unit clauses: 0
% 0.18/0.52 # Negative unit clauses : 5
% 0.18/0.52 # Non-unit-clauses : 207
% 0.18/0.52 # Current number of unprocessed clauses: 1223
% 0.18/0.52 # ...number of literals in the above : 2466
% 0.18/0.52 # Current number of archived formulas : 0
% 0.18/0.52 # Current number of archived clauses : 85
% 0.18/0.52 # Clause-clause subsumption calls (NU) : 3325
% 0.18/0.52 # Rec. Clause-clause subsumption calls : 3078
% 0.18/0.52 # Non-unit clause-clause subsumptions : 283
% 0.18/0.52 # Unit Clause-clause subsumption calls : 758
% 0.18/0.52 # Rewrite failures with RHS unbound : 0
% 0.18/0.52 # BW rewrite match attempts : 281
% 0.18/0.52 # BW rewrite match successes : 14
% 0.18/0.52 # Condensation attempts : 0
% 0.18/0.52 # Condensation successes : 0
% 0.18/0.52 # Termbank termtop insertions : 28944
% 0.18/0.52 # Search garbage collected termcells : 1095
% 0.18/0.52
% 0.18/0.52 # -------------------------------------------------
% 0.18/0.52 # User time : 0.051 s
% 0.18/0.52 # System time : 0.005 s
% 0.18/0.52 # Total time : 0.056 s
% 0.18/0.52 # Maximum resident set size: 1992 pages
% 0.18/0.52
% 0.18/0.52 # -------------------------------------------------
% 0.18/0.52 # User time : 0.232 s
% 0.18/0.52 # System time : 0.027 s
% 0.18/0.52 # Total time : 0.259 s
% 0.18/0.52 # Maximum resident set size: 1744 pages
% 0.18/0.52 % E---3.1 exiting
%------------------------------------------------------------------------------