TSTP Solution File: HWV005-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : HWV005-1 : TPTP v8.2.0. Released v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n019.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 21:36:49 EDT 2024
% Result : Unsatisfiable 0.11s 0.35s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 24
% Syntax : Number of clauses : 101 ( 40 unt; 10 nHn; 101 RR)
% Number of literals : 196 ( 0 equ; 97 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 18 ( 18 usr; 12 con; 0-2 aty)
% Number of variables : 81 ( 7 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(halfadder_connection_outs_out1and1,axiom,
( connection(out(s,X1),out(n1,and1(X1)))
| ~ type(X1,halfadder) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV001-1.ax',halfadder_connection_outs_out1and1) ).
cnf(halfadder_and1,axiom,
( type(and1(X1),and)
| ~ type(X1,halfadder) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV001-1.ax',halfadder_and1) ).
cnf(value_propagation1,axiom,
( value(X2,X3)
| ~ connection(X1,X2)
| ~ value(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV001-0.ax',value_propagation1) ).
cnf(h_isa_halfadder,hypothesis,
type(h,halfadder),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',h_isa_halfadder) ).
cnf(halfadder_or1,axiom,
( type(or1(X1),or)
| ~ type(X1,halfadder) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV001-1.ax',halfadder_or1) ).
cnf(halfadder_connection_in1_in1or1,axiom,
( connection(in(n1,X1),in(n1,or1(X1)))
| ~ type(X1,halfadder) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV001-1.ax',halfadder_connection_in1_in1or1) ).
cnf(halfadder_not1,axiom,
( type(not1(X1),not)
| ~ type(X1,halfadder) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV001-1.ax',halfadder_not1) ).
cnf(halfadder_connection_out1not1_in2and1,axiom,
( connection(out(n1,not1(X1)),in(n2,and1(X1)))
| ~ type(X1,halfadder) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV001-1.ax',halfadder_connection_out1not1_in2and1) ).
cnf(ok_or_abnormal,axiom,
( mode(X1,ok)
| mode(X1,abnormal)
| ~ type(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV001-0.ax',ok_or_abnormal) ).
cnf(diagnosis_and1,negated_conjecture,
~ mode(and1(h),abnormal),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',diagnosis_and1) ).
cnf(diagnosis_or1,negated_conjecture,
~ mode(or1(h),abnormal),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',diagnosis_or1) ).
cnf(diagnosis_not1,negated_conjecture,
~ mode(not1(h),abnormal),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',diagnosis_not1) ).
cnf(value_propagation2,axiom,
( value(X1,X3)
| ~ connection(X1,X2)
| ~ value(X2,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV001-0.ax',value_propagation2) ).
cnf(and_0_00,axiom,
( value(in(n1,X1),n0)
| value(in(n2,X1),n0)
| ~ mode(X1,ok)
| ~ type(X1,and)
| ~ value(out(n1,X1),n0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV001-0.ax',and_0_00) ).
cnf(outs_0,hypothesis,
value(out(s,h),n0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',outs_0) ).
cnf(halfadder_connection_outc_out1and2,axiom,
( connection(out(c,X1),out(n1,and2(X1)))
| ~ type(X1,halfadder) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV001-1.ax',halfadder_connection_outc_out1and2) ).
cnf(halfadder_connection_out1or1_in1_and1,axiom,
( connection(out(n1,or1(X1)),in(n1,and1(X1)))
| ~ type(X1,halfadder) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV001-1.ax',halfadder_connection_out1or1_in1_and1) ).
cnf(or_1x_1,axiom,
( value(out(n1,X1),n1)
| ~ mode(X1,ok)
| ~ type(X1,or)
| ~ value(in(X2,X1),n1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV001-0.ax',or_1x_1) ).
cnf(not_0_1_bw,axiom,
( value(in(n1,X1),n1)
| ~ mode(X1,ok)
| ~ type(X1,not)
| ~ value(out(n1,X1),n0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV001-0.ax',not_0_1_bw) ).
cnf(halfadder_connection_out1and2_in1not1,axiom,
( connection(out(n1,and2(X1)),in(n1,not1(X1)))
| ~ type(X1,halfadder) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV001-1.ax',halfadder_connection_out1and2_in1not1) ).
cnf(in1_1,hypothesis,
value(in(n1,h),n1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',in1_1) ).
cnf(unique_value,axiom,
( equal_value(X2,X3)
| ~ value(X1,X2)
| ~ value(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV001-0.ax',unique_value) ).
cnf(outc_0,hypothesis,
value(out(c,h),n0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',outc_0) ).
cnf(equal_value1,axiom,
~ equal_value(n0,n1),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV001-0.ax',equal_value1) ).
cnf(c_0_24,plain,
( connection(out(s,X1),out(n1,and1(X1)))
| ~ type(X1,halfadder) ),
inference(fof_simplification,[status(thm)],[halfadder_connection_outs_out1and1]) ).
cnf(c_0_25,plain,
( type(and1(X1),and)
| ~ type(X1,halfadder) ),
inference(fof_simplification,[status(thm)],[halfadder_and1]) ).
cnf(c_0_26,plain,
( value(X2,X3)
| ~ connection(X1,X2)
| ~ value(X1,X3) ),
inference(fof_simplification,[status(thm)],[value_propagation1]) ).
cnf(c_0_27,plain,
( connection(out(s,X1),out(n1,and1(X1)))
| ~ type(X1,halfadder) ),
c_0_24 ).
cnf(c_0_28,hypothesis,
type(h,halfadder),
h_isa_halfadder ).
cnf(c_0_29,plain,
( type(or1(X1),or)
| ~ type(X1,halfadder) ),
inference(fof_simplification,[status(thm)],[halfadder_or1]) ).
cnf(c_0_30,plain,
( connection(in(n1,X1),in(n1,or1(X1)))
| ~ type(X1,halfadder) ),
inference(fof_simplification,[status(thm)],[halfadder_connection_in1_in1or1]) ).
cnf(c_0_31,plain,
( type(not1(X1),not)
| ~ type(X1,halfadder) ),
inference(fof_simplification,[status(thm)],[halfadder_not1]) ).
cnf(c_0_32,plain,
( connection(out(n1,not1(X1)),in(n2,and1(X1)))
| ~ type(X1,halfadder) ),
inference(fof_simplification,[status(thm)],[halfadder_connection_out1not1_in2and1]) ).
cnf(c_0_33,plain,
( mode(X1,ok)
| mode(X1,abnormal)
| ~ type(X1,X2) ),
inference(fof_simplification,[status(thm)],[ok_or_abnormal]) ).
cnf(c_0_34,plain,
( type(and1(X1),and)
| ~ type(X1,halfadder) ),
c_0_25 ).
cnf(c_0_35,negated_conjecture,
~ mode(and1(h),abnormal),
inference(fof_simplification,[status(thm)],[diagnosis_and1]) ).
cnf(c_0_36,plain,
( value(X2,X3)
| ~ connection(X1,X2)
| ~ value(X1,X3) ),
c_0_26 ).
cnf(c_0_37,hypothesis,
connection(out(s,h),out(n1,and1(h))),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_38,plain,
( type(or1(X1),or)
| ~ type(X1,halfadder) ),
c_0_29 ).
cnf(c_0_39,negated_conjecture,
~ mode(or1(h),abnormal),
inference(fof_simplification,[status(thm)],[diagnosis_or1]) ).
cnf(c_0_40,plain,
( connection(in(n1,X1),in(n1,or1(X1)))
| ~ type(X1,halfadder) ),
c_0_30 ).
cnf(c_0_41,plain,
( type(not1(X1),not)
| ~ type(X1,halfadder) ),
c_0_31 ).
cnf(c_0_42,negated_conjecture,
~ mode(not1(h),abnormal),
inference(fof_simplification,[status(thm)],[diagnosis_not1]) ).
cnf(c_0_43,plain,
( value(X1,X3)
| ~ connection(X1,X2)
| ~ value(X2,X3) ),
inference(fof_simplification,[status(thm)],[value_propagation2]) ).
cnf(c_0_44,plain,
( connection(out(n1,not1(X1)),in(n2,and1(X1)))
| ~ type(X1,halfadder) ),
c_0_32 ).
cnf(c_0_45,plain,
( value(in(n1,X1),n0)
| value(in(n2,X1),n0)
| ~ mode(X1,ok)
| ~ type(X1,and)
| ~ value(out(n1,X1),n0) ),
inference(fof_simplification,[status(thm)],[and_0_00]) ).
cnf(c_0_46,plain,
( mode(X1,ok)
| mode(X1,abnormal)
| ~ type(X1,X2) ),
c_0_33 ).
cnf(c_0_47,hypothesis,
type(and1(h),and),
inference(spm,[status(thm)],[c_0_34,c_0_28]) ).
cnf(c_0_48,negated_conjecture,
~ mode(and1(h),abnormal),
c_0_35 ).
cnf(c_0_49,hypothesis,
( value(out(n1,and1(h)),X1)
| ~ value(out(s,h),X1) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_50,hypothesis,
value(out(s,h),n0),
outs_0 ).
cnf(c_0_51,plain,
( connection(out(c,X1),out(n1,and2(X1)))
| ~ type(X1,halfadder) ),
inference(fof_simplification,[status(thm)],[halfadder_connection_outc_out1and2]) ).
cnf(c_0_52,plain,
( connection(out(n1,or1(X1)),in(n1,and1(X1)))
| ~ type(X1,halfadder) ),
inference(fof_simplification,[status(thm)],[halfadder_connection_out1or1_in1_and1]) ).
cnf(c_0_53,plain,
( value(out(n1,X1),n1)
| ~ mode(X1,ok)
| ~ type(X1,or)
| ~ value(in(X2,X1),n1) ),
inference(fof_simplification,[status(thm)],[or_1x_1]) ).
cnf(c_0_54,hypothesis,
type(or1(h),or),
inference(spm,[status(thm)],[c_0_38,c_0_28]) ).
cnf(c_0_55,negated_conjecture,
~ mode(or1(h),abnormal),
c_0_39 ).
cnf(c_0_56,hypothesis,
connection(in(n1,h),in(n1,or1(h))),
inference(spm,[status(thm)],[c_0_40,c_0_28]) ).
cnf(c_0_57,plain,
( value(in(n1,X1),n1)
| ~ mode(X1,ok)
| ~ type(X1,not)
| ~ value(out(n1,X1),n0) ),
inference(fof_simplification,[status(thm)],[not_0_1_bw]) ).
cnf(c_0_58,hypothesis,
type(not1(h),not),
inference(spm,[status(thm)],[c_0_41,c_0_28]) ).
cnf(c_0_59,negated_conjecture,
~ mode(not1(h),abnormal),
c_0_42 ).
cnf(c_0_60,plain,
( value(X1,X3)
| ~ connection(X1,X2)
| ~ value(X2,X3) ),
c_0_43 ).
cnf(c_0_61,hypothesis,
connection(out(n1,not1(h)),in(n2,and1(h))),
inference(spm,[status(thm)],[c_0_44,c_0_28]) ).
cnf(c_0_62,plain,
( value(in(n1,X1),n0)
| value(in(n2,X1),n0)
| ~ mode(X1,ok)
| ~ type(X1,and)
| ~ value(out(n1,X1),n0) ),
c_0_45 ).
cnf(c_0_63,hypothesis,
mode(and1(h),ok),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_48]) ).
cnf(c_0_64,hypothesis,
value(out(n1,and1(h)),n0),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_65,plain,
( connection(out(n1,and2(X1)),in(n1,not1(X1)))
| ~ type(X1,halfadder) ),
inference(fof_simplification,[status(thm)],[halfadder_connection_out1and2_in1not1]) ).
cnf(c_0_66,plain,
( connection(out(c,X1),out(n1,and2(X1)))
| ~ type(X1,halfadder) ),
c_0_51 ).
cnf(c_0_67,plain,
( connection(out(n1,or1(X1)),in(n1,and1(X1)))
| ~ type(X1,halfadder) ),
c_0_52 ).
cnf(c_0_68,plain,
( value(out(n1,X1),n1)
| ~ mode(X1,ok)
| ~ type(X1,or)
| ~ value(in(X2,X1),n1) ),
c_0_53 ).
cnf(c_0_69,hypothesis,
mode(or1(h),ok),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_54]),c_0_55]) ).
cnf(c_0_70,hypothesis,
( value(in(n1,or1(h)),X1)
| ~ value(in(n1,h),X1) ),
inference(spm,[status(thm)],[c_0_36,c_0_56]) ).
cnf(c_0_71,hypothesis,
value(in(n1,h),n1),
in1_1 ).
cnf(c_0_72,plain,
( value(in(n1,X1),n1)
| ~ mode(X1,ok)
| ~ type(X1,not)
| ~ value(out(n1,X1),n0) ),
c_0_57 ).
cnf(c_0_73,hypothesis,
mode(not1(h),ok),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_58]),c_0_59]) ).
cnf(c_0_74,hypothesis,
( value(out(n1,not1(h)),X1)
| ~ value(in(n2,and1(h)),X1) ),
inference(spm,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_75,hypothesis,
( value(in(n2,and1(h)),n0)
| value(in(n1,and1(h)),n0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_47]),c_0_63]),c_0_64])]) ).
cnf(c_0_76,plain,
( connection(out(n1,and2(X1)),in(n1,not1(X1)))
| ~ type(X1,halfadder) ),
c_0_65 ).
cnf(c_0_77,hypothesis,
connection(out(c,h),out(n1,and2(h))),
inference(spm,[status(thm)],[c_0_66,c_0_28]) ).
cnf(c_0_78,hypothesis,
connection(out(n1,or1(h)),in(n1,and1(h))),
inference(spm,[status(thm)],[c_0_67,c_0_28]) ).
cnf(c_0_79,hypothesis,
( value(out(n1,or1(h)),n1)
| ~ value(in(X1,or1(h)),n1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_54]),c_0_69])]) ).
cnf(c_0_80,hypothesis,
value(in(n1,or1(h)),n1),
inference(spm,[status(thm)],[c_0_70,c_0_71]) ).
cnf(c_0_81,plain,
( equal_value(X2,X3)
| ~ value(X1,X2)
| ~ value(X1,X3) ),
inference(fof_simplification,[status(thm)],[unique_value]) ).
cnf(c_0_82,hypothesis,
( value(in(n1,not1(h)),n1)
| ~ value(out(n1,not1(h)),n0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_58]),c_0_73])]) ).
cnf(c_0_83,hypothesis,
( value(in(n1,and1(h)),n0)
| value(out(n1,not1(h)),n0) ),
inference(spm,[status(thm)],[c_0_74,c_0_75]) ).
cnf(c_0_84,hypothesis,
connection(out(n1,and2(h)),in(n1,not1(h))),
inference(spm,[status(thm)],[c_0_76,c_0_28]) ).
cnf(c_0_85,hypothesis,
( value(out(n1,and2(h)),X1)
| ~ value(out(c,h),X1) ),
inference(spm,[status(thm)],[c_0_36,c_0_77]) ).
cnf(c_0_86,hypothesis,
value(out(c,h),n0),
outc_0 ).
cnf(c_0_87,hypothesis,
( value(in(n1,and1(h)),X1)
| ~ value(out(n1,or1(h)),X1) ),
inference(spm,[status(thm)],[c_0_36,c_0_78]) ).
cnf(c_0_88,hypothesis,
value(out(n1,or1(h)),n1),
inference(spm,[status(thm)],[c_0_79,c_0_80]) ).
cnf(c_0_89,plain,
( equal_value(X2,X3)
| ~ value(X1,X2)
| ~ value(X1,X3) ),
c_0_81 ).
cnf(c_0_90,hypothesis,
( value(in(n1,and1(h)),n0)
| value(in(n1,not1(h)),n1) ),
inference(spm,[status(thm)],[c_0_82,c_0_83]) ).
cnf(c_0_91,hypothesis,
( value(in(n1,not1(h)),X1)
| ~ value(out(n1,and2(h)),X1) ),
inference(spm,[status(thm)],[c_0_36,c_0_84]) ).
cnf(c_0_92,hypothesis,
value(out(n1,and2(h)),n0),
inference(spm,[status(thm)],[c_0_85,c_0_86]) ).
cnf(c_0_93,plain,
~ equal_value(n0,n1),
inference(fof_simplification,[status(thm)],[equal_value1]) ).
cnf(c_0_94,hypothesis,
value(in(n1,and1(h)),n1),
inference(spm,[status(thm)],[c_0_87,c_0_88]) ).
cnf(c_0_95,hypothesis,
( equal_value(X1,n1)
| value(in(n1,and1(h)),n0)
| ~ value(in(n1,not1(h)),X1) ),
inference(spm,[status(thm)],[c_0_89,c_0_90]) ).
cnf(c_0_96,hypothesis,
value(in(n1,not1(h)),n0),
inference(spm,[status(thm)],[c_0_91,c_0_92]) ).
cnf(c_0_97,plain,
~ equal_value(n0,n1),
c_0_93 ).
cnf(c_0_98,hypothesis,
( equal_value(X1,n1)
| ~ value(in(n1,and1(h)),X1) ),
inference(spm,[status(thm)],[c_0_89,c_0_94]) ).
cnf(c_0_99,hypothesis,
value(in(n1,and1(h)),n0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_95,c_0_96]),c_0_97]) ).
cnf(c_0_100,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_98,c_0_99]),c_0_97]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.07 % Problem : HWV005-1 : TPTP v8.2.0. Released v2.1.0.
% 0.07/0.08 % Command : run_E %s %d THM
% 0.07/0.26 % Computer : n019.cluster.edu
% 0.07/0.26 % Model : x86_64 x86_64
% 0.07/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.26 % Memory : 8042.1875MB
% 0.07/0.26 % OS : Linux 3.10.0-693.el7.x86_64
% 0.07/0.26 % CPULimit : 300
% 0.07/0.26 % WCLimit : 300
% 0.07/0.26 % DateTime : Sun May 19 11:10:37 EDT 2024
% 0.07/0.26 % CPUTime :
% 0.11/0.33 Running first-order model finding
% 0.11/0.33 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.11/0.35 # Version: 3.1.0
% 0.11/0.35 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.11/0.35 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.35 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.11/0.35 # Starting new_bool_3 with 300s (1) cores
% 0.11/0.35 # Starting new_bool_1 with 300s (1) cores
% 0.11/0.35 # Starting sh5l with 300s (1) cores
% 0.11/0.35 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 28042 completed with status 0
% 0.11/0.35 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.11/0.35 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.11/0.35 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.35 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.11/0.35 # No SInE strategy applied
% 0.11/0.35 # Search class: FGHNF-FFMS21-SFFFFFNN
% 0.11/0.35 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.11/0.35 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.11/0.35 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.11/0.35 # Starting new_bool_3 with 136s (1) cores
% 0.11/0.35 # Starting new_bool_1 with 136s (1) cores
% 0.11/0.35 # Starting sh5l with 136s (1) cores
% 0.11/0.35 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 28048 completed with status 0
% 0.11/0.35 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.11/0.35 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.11/0.35 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.35 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.11/0.35 # No SInE strategy applied
% 0.11/0.35 # Search class: FGHNF-FFMS21-SFFFFFNN
% 0.11/0.35 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.11/0.35 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.11/0.35 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.11/0.35 # Preprocessing time : 0.001 s
% 0.11/0.35 # Presaturation interreduction done
% 0.11/0.35
% 0.11/0.35 # Proof found!
% 0.11/0.35 # SZS status Unsatisfiable
% 0.11/0.35 # SZS output start CNFRefutation
% See solution above
% 0.11/0.35 # Parsed axioms : 42
% 0.11/0.35 # Removed by relevancy pruning/SinE : 0
% 0.11/0.35 # Initial clauses : 42
% 0.11/0.35 # Removed in clause preprocessing : 0
% 0.11/0.35 # Initial clauses in saturation : 42
% 0.11/0.35 # Processed clauses : 167
% 0.11/0.35 # ...of these trivial : 2
% 0.11/0.35 # ...subsumed : 5
% 0.11/0.35 # ...remaining for further processing : 160
% 0.11/0.35 # Other redundant clauses eliminated : 0
% 0.11/0.35 # Clauses deleted for lack of memory : 0
% 0.11/0.35 # Backward-subsumed : 0
% 0.11/0.35 # Backward-rewritten : 11
% 0.11/0.35 # Generated clauses : 116
% 0.11/0.35 # ...of the previous two non-redundant : 97
% 0.11/0.35 # ...aggressively subsumed : 0
% 0.11/0.35 # Contextual simplify-reflections : 0
% 0.11/0.35 # Paramodulations : 116
% 0.11/0.35 # Factorizations : 0
% 0.11/0.35 # NegExts : 0
% 0.11/0.35 # Equation resolutions : 0
% 0.11/0.35 # Disequality decompositions : 0
% 0.11/0.35 # Total rewrite steps : 46
% 0.11/0.35 # ...of those cached : 31
% 0.11/0.35 # Propositional unsat checks : 0
% 0.11/0.35 # Propositional check models : 0
% 0.11/0.35 # Propositional check unsatisfiable : 0
% 0.11/0.35 # Propositional clauses : 0
% 0.11/0.35 # Propositional clauses after purity: 0
% 0.11/0.35 # Propositional unsat core size : 0
% 0.11/0.35 # Propositional preprocessing time : 0.000
% 0.11/0.35 # Propositional encoding time : 0.000
% 0.11/0.35 # Propositional solver time : 0.000
% 0.11/0.35 # Success case prop preproc time : 0.000
% 0.11/0.35 # Success case prop encoding time : 0.000
% 0.11/0.35 # Success case prop solver time : 0.000
% 0.11/0.35 # Current number of processed clauses : 107
% 0.11/0.35 # Positive orientable unit clauses : 34
% 0.11/0.35 # Positive unorientable unit clauses: 0
% 0.11/0.35 # Negative unit clauses : 5
% 0.11/0.35 # Non-unit-clauses : 68
% 0.11/0.35 # Current number of unprocessed clauses: 12
% 0.11/0.35 # ...number of literals in the above : 33
% 0.11/0.35 # Current number of archived formulas : 0
% 0.11/0.35 # Current number of archived clauses : 53
% 0.11/0.35 # Clause-clause subsumption calls (NU) : 1193
% 0.11/0.35 # Rec. Clause-clause subsumption calls : 746
% 0.11/0.35 # Non-unit clause-clause subsumptions : 2
% 0.11/0.35 # Unit Clause-clause subsumption calls : 131
% 0.11/0.35 # Rewrite failures with RHS unbound : 0
% 0.11/0.35 # BW rewrite match attempts : 7
% 0.11/0.35 # BW rewrite match successes : 4
% 0.11/0.35 # Condensation attempts : 0
% 0.11/0.35 # Condensation successes : 0
% 0.11/0.35 # Termbank termtop insertions : 4334
% 0.11/0.35 # Search garbage collected termcells : 97
% 0.11/0.35
% 0.11/0.35 # -------------------------------------------------
% 0.11/0.35 # User time : 0.005 s
% 0.11/0.35 # System time : 0.003 s
% 0.11/0.35 # Total time : 0.008 s
% 0.11/0.35 # Maximum resident set size: 1688 pages
% 0.11/0.35
% 0.11/0.35 # -------------------------------------------------
% 0.11/0.35 # User time : 0.029 s
% 0.11/0.35 # System time : 0.009 s
% 0.11/0.35 # Total time : 0.038 s
% 0.11/0.35 # Maximum resident set size: 1764 pages
% 0.11/0.35 % E---3.1 exiting
%------------------------------------------------------------------------------