TSTP Solution File: REL043+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : REL043+2 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n021.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 : 600s
% DateTime : Mon Jul 18 19:13:50 EDT 2022
% Result : Theorem 21.27s 4.14s
% Output : CNFRefutation 21.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 14
% Syntax : Number of formulae : 99 ( 96 unt; 0 def)
% Number of atoms : 102 ( 101 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 7 ( 4 ~; 0 |; 1 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 11 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 6 con; 0-2 aty)
% Number of variables : 150 ( 11 sgn 56 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(converse_multiplicativity,axiom,
! [X1,X2] : converse(composition(X1,X2)) = composition(converse(X2),converse(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/REL001+0.ax',converse_multiplicativity) ).
fof(converse_idempotence,axiom,
! [X1] : converse(converse(X1)) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/REL001+0.ax',converse_idempotence) ).
fof(composition_identity,axiom,
! [X1] : composition(X1,one) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/REL001+0.ax',composition_identity) ).
fof(converse_cancellativity,axiom,
! [X1,X2] : join(composition(converse(X1),complement(composition(X1,X2))),complement(X2)) = complement(X2),
file('/export/starexec/sandbox/benchmark/Axioms/REL001+0.ax',converse_cancellativity) ).
fof(maddux1_join_commutativity,axiom,
! [X1,X2] : join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox/benchmark/Axioms/REL001+0.ax',maddux1_join_commutativity) ).
fof(def_zero,axiom,
! [X1] : zero = meet(X1,complement(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/REL001+0.ax',def_zero) ).
fof(maddux4_definiton_of_meet,axiom,
! [X1,X2] : meet(X1,X2) = complement(join(complement(X1),complement(X2))),
file('/export/starexec/sandbox/benchmark/Axioms/REL001+0.ax',maddux4_definiton_of_meet) ).
fof(def_top,axiom,
! [X1] : top = join(X1,complement(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/REL001+0.ax',def_top) ).
fof(maddux3_a_kind_of_de_Morgan,axiom,
! [X1,X2] : X1 = join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2))),
file('/export/starexec/sandbox/benchmark/Axioms/REL001+0.ax',maddux3_a_kind_of_de_Morgan) ).
fof(maddux2_join_associativity,axiom,
! [X1,X2,X3] : join(X1,join(X2,X3)) = join(join(X1,X2),X3),
file('/export/starexec/sandbox/benchmark/Axioms/REL001+0.ax',maddux2_join_associativity) ).
fof(composition_distributivity,axiom,
! [X1,X2,X3] : composition(join(X1,X2),X3) = join(composition(X1,X3),composition(X2,X3)),
file('/export/starexec/sandbox/benchmark/Axioms/REL001+0.ax',composition_distributivity) ).
fof(converse_additivity,axiom,
! [X1,X2] : converse(join(X1,X2)) = join(converse(X1),converse(X2)),
file('/export/starexec/sandbox/benchmark/Axioms/REL001+0.ax',converse_additivity) ).
fof(modular_law_2,axiom,
! [X1,X2,X3] : join(meet(composition(X1,X2),X3),meet(composition(meet(X1,composition(X3,converse(X2))),X2),X3)) = meet(composition(meet(X1,composition(X3,converse(X2))),X2),X3),
file('/export/starexec/sandbox/benchmark/Axioms/REL001+1.ax',modular_law_2) ).
fof(goals,conjecture,
! [X1,X2,X3] :
( join(composition(X1,converse(X2)),X3) = X3
=> join(composition(complement(X3),X2),complement(X1)) = complement(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(c_0_14,plain,
! [X23,X24] : converse(composition(X23,X24)) = composition(converse(X24),converse(X23)),
inference(variable_rename,[status(thm)],[converse_multiplicativity]) ).
fof(c_0_15,plain,
! [X20] : converse(converse(X20)) = X20,
inference(variable_rename,[status(thm)],[converse_idempotence]) ).
cnf(c_0_16,plain,
converse(composition(X1,X2)) = composition(converse(X2),converse(X1)),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_17,plain,
converse(converse(X1)) = X1,
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_18,plain,
! [X16] : composition(X16,one) = X16,
inference(variable_rename,[status(thm)],[composition_identity]) ).
cnf(c_0_19,plain,
converse(composition(converse(X1),X2)) = composition(converse(X2),X1),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,plain,
composition(X1,one) = X1,
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_21,plain,
! [X25,X26] : join(composition(converse(X25),complement(composition(X25,X26))),complement(X26)) = complement(X26),
inference(variable_rename,[status(thm)],[converse_cancellativity]) ).
fof(c_0_22,plain,
! [X4,X5] : join(X4,X5) = join(X5,X4),
inference(variable_rename,[status(thm)],[maddux1_join_commutativity]) ).
cnf(c_0_23,plain,
composition(converse(one),X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_17]) ).
fof(c_0_24,plain,
! [X28] : zero = meet(X28,complement(X28)),
inference(variable_rename,[status(thm)],[def_zero]) ).
fof(c_0_25,plain,
! [X11,X12] : meet(X11,X12) = complement(join(complement(X11),complement(X12))),
inference(variable_rename,[status(thm)],[maddux4_definiton_of_meet]) ).
cnf(c_0_26,plain,
join(composition(converse(X1),complement(composition(X1,X2))),complement(X2)) = complement(X2),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_27,plain,
join(X1,X2) = join(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_28,plain,
converse(one) = one,
inference(spm,[status(thm)],[c_0_20,c_0_23]) ).
cnf(c_0_29,plain,
zero = meet(X1,complement(X1)),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_30,plain,
meet(X1,X2) = complement(join(complement(X1),complement(X2))),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
fof(c_0_31,plain,
! [X27] : top = join(X27,complement(X27)),
inference(variable_rename,[status(thm)],[def_top]) ).
cnf(c_0_32,plain,
join(complement(X1),composition(converse(X2),complement(composition(X2,X1)))) = complement(X1),
inference(rw,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_33,plain,
composition(one,X1) = X1,
inference(rw,[status(thm)],[c_0_23,c_0_28]) ).
cnf(c_0_34,plain,
zero = complement(join(complement(X1),complement(complement(X1)))),
inference(rw,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_35,plain,
top = join(X1,complement(X1)),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
fof(c_0_36,plain,
! [X9,X10] : X9 = join(complement(join(complement(X9),complement(X10))),complement(join(complement(X9),X10))),
inference(variable_rename,[status(thm)],[maddux3_a_kind_of_de_Morgan]) ).
fof(c_0_37,plain,
! [X6,X7,X8] : join(X6,join(X7,X8)) = join(join(X6,X7),X8),
inference(variable_rename,[status(thm)],[maddux2_join_associativity]) ).
cnf(c_0_38,plain,
join(complement(X1),complement(X1)) = complement(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_28]),c_0_33]) ).
cnf(c_0_39,plain,
complement(top) = zero,
inference(rw,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_40,plain,
X1 = join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2))),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_41,plain,
join(X1,join(X2,X3)) = join(join(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_42,plain,
join(zero,zero) = zero,
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_43,plain,
join(complement(join(complement(X1),X2)),complement(join(complement(X1),complement(X2)))) = X1,
inference(rw,[status(thm)],[c_0_40,c_0_27]) ).
cnf(c_0_44,plain,
join(zero,join(zero,X1)) = join(zero,X1),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_45,plain,
join(zero,complement(complement(X1))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_35]),c_0_38]),c_0_39]),c_0_27]) ).
cnf(c_0_46,plain,
join(zero,X1) = X1,
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_47,plain,
join(X1,join(complement(X1),X2)) = join(top,X2),
inference(spm,[status(thm)],[c_0_41,c_0_35]) ).
cnf(c_0_48,plain,
join(X1,join(X2,complement(join(X1,X2)))) = top,
inference(spm,[status(thm)],[c_0_35,c_0_41]) ).
cnf(c_0_49,plain,
complement(complement(X1)) = X1,
inference(rw,[status(thm)],[c_0_45,c_0_46]) ).
fof(c_0_50,plain,
! [X17,X18,X19] : composition(join(X17,X18),X19) = join(composition(X17,X19),composition(X18,X19)),
inference(variable_rename,[status(thm)],[composition_distributivity]) ).
cnf(c_0_51,plain,
join(top,complement(complement(X1))) = join(X1,top),
inference(spm,[status(thm)],[c_0_47,c_0_35]) ).
cnf(c_0_52,plain,
join(top,complement(X1)) = top,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_38]),c_0_35]),c_0_27]) ).
fof(c_0_53,plain,
! [X21,X22] : converse(join(X21,X22)) = join(converse(X21),converse(X22)),
inference(variable_rename,[status(thm)],[converse_additivity]) ).
cnf(c_0_54,plain,
join(X1,X1) = X1,
inference(spm,[status(thm)],[c_0_38,c_0_49]) ).
cnf(c_0_55,plain,
composition(join(X1,X2),X3) = join(composition(X1,X3),composition(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_56,plain,
join(X1,top) = top,
inference(rw,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_57,plain,
converse(join(X1,X2)) = join(converse(X1),converse(X2)),
inference(split_conjunct,[status(thm)],[c_0_53]) ).
cnf(c_0_58,plain,
join(X1,join(X1,X2)) = join(X1,X2),
inference(spm,[status(thm)],[c_0_41,c_0_54]) ).
cnf(c_0_59,plain,
join(X1,composition(X2,X1)) = composition(join(X2,one),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_33]),c_0_27]) ).
cnf(c_0_60,plain,
join(top,X1) = top,
inference(spm,[status(thm)],[c_0_27,c_0_56]) ).
cnf(c_0_61,plain,
converse(join(converse(X1),X2)) = join(X1,converse(X2)),
inference(spm,[status(thm)],[c_0_57,c_0_17]) ).
cnf(c_0_62,plain,
join(X1,complement(join(complement(X1),X2))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_43]),c_0_27]) ).
cnf(c_0_63,plain,
join(X1,join(X2,X1)) = join(X2,X1),
inference(spm,[status(thm)],[c_0_58,c_0_27]) ).
fof(c_0_64,plain,
! [X35,X36,X37] : join(meet(composition(X35,X36),X37),meet(composition(meet(X35,composition(X37,converse(X36))),X36),X37)) = meet(composition(meet(X35,composition(X37,converse(X36))),X36),X37),
inference(variable_rename,[status(thm)],[modular_law_2]) ).
fof(c_0_65,negated_conjecture,
~ ! [X1,X2,X3] :
( join(composition(X1,converse(X2)),X3) = X3
=> join(composition(complement(X3),X2),complement(X1)) = complement(X1) ),
inference(assume_negation,[status(cth)],[goals]) ).
cnf(c_0_66,plain,
join(X1,composition(top,X1)) = composition(top,X1),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_67,plain,
join(X1,converse(complement(converse(X1)))) = converse(top),
inference(spm,[status(thm)],[c_0_61,c_0_35]) ).
cnf(c_0_68,plain,
join(X1,complement(join(X2,complement(X1)))) = X1,
inference(spm,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_69,plain,
join(meet(composition(X1,X2),X3),meet(composition(meet(X1,composition(X3,converse(X2))),X2),X3)) = meet(composition(meet(X1,composition(X3,converse(X2))),X2),X3),
inference(split_conjunct,[status(thm)],[c_0_64]) ).
fof(c_0_70,negated_conjecture,
( join(composition(esk1_0,converse(esk2_0)),esk3_0) = esk3_0
& join(composition(complement(esk3_0),esk2_0),complement(esk1_0)) != complement(esk1_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_65])])]) ).
cnf(c_0_71,plain,
composition(top,top) = top,
inference(spm,[status(thm)],[c_0_60,c_0_66]) ).
cnf(c_0_72,plain,
converse(top) = top,
inference(spm,[status(thm)],[c_0_67,c_0_60]) ).
cnf(c_0_73,plain,
converse(join(X1,converse(X2))) = join(converse(X1),X2),
inference(spm,[status(thm)],[c_0_57,c_0_17]) ).
cnf(c_0_74,plain,
join(X1,join(complement(join(X2,complement(X1))),X3)) = join(X1,X3),
inference(spm,[status(thm)],[c_0_41,c_0_68]) ).
cnf(c_0_75,plain,
join(complement(join(complement(composition(X1,X2)),complement(X3))),complement(join(complement(composition(complement(join(complement(X1),complement(composition(X3,converse(X2))))),X2)),complement(X3)))) = complement(join(complement(composition(complement(join(complement(X1),complement(composition(X3,converse(X2))))),X2)),complement(X3))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_69,c_0_30]),c_0_30]),c_0_30]),c_0_30]),c_0_30]) ).
cnf(c_0_76,plain,
join(X1,join(complement(X1),X2)) = top,
inference(rw,[status(thm)],[c_0_47,c_0_60]) ).
cnf(c_0_77,negated_conjecture,
join(composition(esk1_0,converse(esk2_0)),esk3_0) = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_70]) ).
cnf(c_0_78,plain,
composition(top,zero) = zero,
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_32,c_0_71]),c_0_39]),c_0_72]),c_0_39]),c_0_46]),c_0_39]) ).
cnf(c_0_79,plain,
join(X1,zero) = X1,
inference(spm,[status(thm)],[c_0_27,c_0_46]) ).
cnf(c_0_80,plain,
join(converse(zero),X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_46]),c_0_17]) ).
cnf(c_0_81,plain,
join(X1,complement(join(complement(X2),X1))) = join(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_43]),c_0_49]) ).
cnf(c_0_82,plain,
join(complement(join(complement(composition(X1,X2)),complement(X3))),complement(join(complement(X3),complement(composition(complement(join(complement(X1),complement(composition(X3,converse(X2))))),X2))))) = complement(join(complement(X3),complement(composition(complement(join(complement(X1),complement(composition(X3,converse(X2))))),X2)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_75,c_0_27]),c_0_27]) ).
cnf(c_0_83,plain,
join(complement(X1),join(X2,X1)) = top,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_43]),c_0_41]) ).
cnf(c_0_84,negated_conjecture,
join(esk3_0,composition(esk1_0,converse(esk2_0))) = esk3_0,
inference(rw,[status(thm)],[c_0_77,c_0_27]) ).
cnf(c_0_85,plain,
composition(X1,zero) = zero,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_78]),c_0_46]),c_0_60]),c_0_78]) ).
cnf(c_0_86,plain,
converse(zero) = zero,
inference(spm,[status(thm)],[c_0_79,c_0_80]) ).
cnf(c_0_87,plain,
join(X1,complement(join(X2,X1))) = join(X1,complement(X2)),
inference(spm,[status(thm)],[c_0_81,c_0_49]) ).
cnf(c_0_88,plain,
join(X1,join(X2,complement(join(X2,X1)))) = top,
inference(spm,[status(thm)],[c_0_48,c_0_27]) ).
cnf(c_0_89,plain,
join(complement(X1),complement(join(X2,X1))) = complement(X1),
inference(spm,[status(thm)],[c_0_68,c_0_49]) ).
cnf(c_0_90,plain,
join(complement(join(complement(composition(complement(X1),X2)),complement(X3))),complement(join(complement(X3),complement(composition(complement(join(X1,complement(composition(X3,converse(X2))))),X2))))) = complement(join(complement(X3),complement(composition(complement(join(X1,complement(composition(X3,converse(X2))))),X2)))),
inference(spm,[status(thm)],[c_0_82,c_0_49]) ).
cnf(c_0_91,negated_conjecture,
join(esk3_0,complement(composition(esk1_0,converse(esk2_0)))) = top,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_84]),c_0_27]) ).
cnf(c_0_92,plain,
composition(zero,X1) = zero,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_85]),c_0_86]),c_0_86]) ).
cnf(c_0_93,plain,
complement(zero) = top,
inference(spm,[status(thm)],[c_0_35,c_0_46]) ).
cnf(c_0_94,negated_conjecture,
join(composition(complement(esk3_0),esk2_0),complement(esk1_0)) != complement(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_70]) ).
cnf(c_0_95,plain,
join(X1,complement(join(X1,X2))) = join(X1,complement(X2)),
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_87,c_0_88]),c_0_39]),c_0_41]),c_0_79]),c_0_41]),c_0_27]),c_0_89]) ).
cnf(c_0_96,negated_conjecture,
complement(join(complement(esk1_0),complement(composition(complement(esk3_0),esk2_0)))) = zero,
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(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_90,c_0_91]),c_0_39]),c_0_92]),c_0_93]),c_0_56]),c_0_39]),c_0_79]),c_0_39]),c_0_92]),c_0_93]),c_0_56]),c_0_39]),c_0_27]) ).
cnf(c_0_97,negated_conjecture,
join(complement(esk1_0),composition(complement(esk3_0),esk2_0)) != complement(esk1_0),
inference(rw,[status(thm)],[c_0_94,c_0_27]) ).
cnf(c_0_98,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_95,c_0_96]),c_0_79]),c_0_49]),c_0_97]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : REL043+2 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n021.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Fri Jul 8 12:34:07 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.46 # ENIGMATIC: Selected SinE mode:
% 0.20/0.46 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.46 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.20/0.46 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.20/0.46 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 21.27/4.14 # ENIGMATIC: Solved by autoschedule:
% 21.27/4.14 # No SInE strategy applied
% 21.27/4.14 # Trying AutoSched0 for 150 seconds
% 21.27/4.14 # AutoSched0-Mode selected heuristic H_____047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S
% 21.27/4.14 # and selection function SelectNewComplexAHP.
% 21.27/4.14 #
% 21.27/4.14 # Preprocessing time : 0.023 s
% 21.27/4.14 # Presaturation interreduction done
% 21.27/4.14
% 21.27/4.14 # Proof found!
% 21.27/4.14 # SZS status Theorem
% 21.27/4.14 # SZS output start CNFRefutation
% See solution above
% 21.27/4.15 # Training examples: 0 positive, 0 negative
% 21.27/4.15
% 21.27/4.15 # -------------------------------------------------
% 21.27/4.15 # User time : 1.568 s
% 21.27/4.15 # System time : 0.094 s
% 21.27/4.15 # Total time : 1.662 s
% 21.27/4.15 # Maximum resident set size: 7124 pages
% 21.27/4.15
%------------------------------------------------------------------------------