TSTP Solution File: REL048+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : REL048+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n007.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:55 EDT 2022
% Result : Theorem 8.47s 2.50s
% Output : CNFRefutation 8.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 12
% Syntax : Number of formulae : 65 ( 60 unt; 0 def)
% Number of atoms : 73 ( 72 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 16 ( 8 ~; 3 |; 3 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 2 avg)
% Maximal term depth : 5 ( 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 : 93 ( 0 sgn 46 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(converse_multiplicativity,axiom,
! [X1,X2] : converse(composition(X1,X2)) = composition(converse(X2),converse(X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001+0.ax',converse_multiplicativity) ).
fof(converse_idempotence,axiom,
! [X1] : converse(converse(X1)) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/REL001+0.ax',converse_idempotence) ).
fof(composition_identity,axiom,
! [X1] : composition(X1,one) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/REL001+0.ax',composition_identity) ).
fof(composition_distributivity,axiom,
! [X1,X2,X3] : composition(join(X1,X2),X3) = join(composition(X1,X3),composition(X2,X3)),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001+0.ax',composition_distributivity) ).
fof(maddux1_join_commutativity,axiom,
! [X1,X2] : join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001+0.ax',maddux1_join_commutativity) ).
fof(converse_cancellativity,axiom,
! [X1,X2] : join(composition(converse(X1),complement(composition(X1,X2))),complement(X2)) = complement(X2),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001+0.ax',converse_cancellativity) ).
fof(def_zero,axiom,
! [X1] : zero = meet(X1,complement(X1)),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/Axioms/REL001+0.ax',maddux4_definiton_of_meet) ).
fof(def_top,axiom,
! [X1] : top = join(X1,complement(X1)),
file('/export/starexec/sandbox2/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/sandbox2/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/sandbox2/benchmark/Axioms/REL001+0.ax',maddux2_join_associativity) ).
fof(goals,conjecture,
! [X1,X2,X3] :
( join(join(X1,X2),X3) = X3
=> ( join(X1,X3) = X3
& join(X2,X3) = X3 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(c_0_12,plain,
! [X23,X24] : converse(composition(X23,X24)) = composition(converse(X24),converse(X23)),
inference(variable_rename,[status(thm)],[converse_multiplicativity]) ).
fof(c_0_13,plain,
! [X20] : converse(converse(X20)) = X20,
inference(variable_rename,[status(thm)],[converse_idempotence]) ).
cnf(c_0_14,plain,
converse(composition(X1,X2)) = composition(converse(X2),converse(X1)),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_15,plain,
converse(converse(X1)) = X1,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_16,plain,
! [X16] : composition(X16,one) = X16,
inference(variable_rename,[status(thm)],[composition_identity]) ).
cnf(c_0_17,plain,
converse(composition(converse(X1),X2)) = composition(converse(X2),X1),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,plain,
composition(X1,one) = X1,
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_19,plain,
composition(converse(one),X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_15]) ).
fof(c_0_20,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_21,plain,
converse(one) = one,
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
fof(c_0_22,plain,
! [X4,X5] : join(X4,X5) = join(X5,X4),
inference(variable_rename,[status(thm)],[maddux1_join_commutativity]) ).
fof(c_0_23,plain,
! [X25,X26] : join(composition(converse(X25),complement(composition(X25,X26))),complement(X26)) = complement(X26),
inference(variable_rename,[status(thm)],[converse_cancellativity]) ).
cnf(c_0_24,plain,
composition(join(X1,X2),X3) = join(composition(X1,X3),composition(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_25,plain,
composition(one,X1) = X1,
inference(rw,[status(thm)],[c_0_19,c_0_21]) ).
cnf(c_0_26,plain,
join(X1,X2) = join(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
fof(c_0_27,plain,
! [X28] : zero = meet(X28,complement(X28)),
inference(variable_rename,[status(thm)],[def_zero]) ).
fof(c_0_28,plain,
! [X11,X12] : meet(X11,X12) = complement(join(complement(X11),complement(X12))),
inference(variable_rename,[status(thm)],[maddux4_definiton_of_meet]) ).
cnf(c_0_29,plain,
join(composition(converse(X1),complement(composition(X1,X2))),complement(X2)) = complement(X2),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_30,plain,
join(X1,composition(X2,X1)) = composition(join(X2,one),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]) ).
cnf(c_0_31,plain,
zero = meet(X1,complement(X1)),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_32,plain,
meet(X1,X2) = complement(join(complement(X1),complement(X2))),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
fof(c_0_33,plain,
! [X27] : top = join(X27,complement(X27)),
inference(variable_rename,[status(thm)],[def_top]) ).
cnf(c_0_34,plain,
join(complement(X1),composition(converse(X2),complement(composition(X2,X1)))) = complement(X1),
inference(rw,[status(thm)],[c_0_29,c_0_26]) ).
cnf(c_0_35,plain,
join(X1,X1) = composition(join(one,one),X1),
inference(spm,[status(thm)],[c_0_30,c_0_25]) ).
cnf(c_0_36,plain,
zero = complement(join(complement(X1),complement(complement(X1)))),
inference(rw,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_37,plain,
top = join(X1,complement(X1)),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
fof(c_0_38,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_39,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_40,plain,
composition(join(one,one),complement(X1)) = complement(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_25]),c_0_21]),c_0_25]),c_0_35]) ).
cnf(c_0_41,plain,
complement(top) = zero,
inference(rw,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_42,plain,
X1 = join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2))),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_43,plain,
join(X1,join(X2,X3)) = join(join(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_44,plain,
join(zero,zero) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_35]) ).
cnf(c_0_45,plain,
join(complement(join(complement(X1),X2)),complement(join(complement(X1),complement(X2)))) = X1,
inference(rw,[status(thm)],[c_0_42,c_0_26]) ).
cnf(c_0_46,plain,
join(zero,join(zero,X1)) = join(zero,X1),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_47,plain,
join(zero,complement(complement(X1))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_37]),c_0_35]),c_0_40]),c_0_41]),c_0_26]) ).
cnf(c_0_48,plain,
join(zero,X1) = X1,
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_49,plain,
complement(complement(X1)) = X1,
inference(rw,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_50,plain,
composition(join(one,one),X1) = X1,
inference(spm,[status(thm)],[c_0_40,c_0_49]) ).
cnf(c_0_51,plain,
join(X1,X1) = X1,
inference(rw,[status(thm)],[c_0_35,c_0_50]) ).
fof(c_0_52,negated_conjecture,
~ ! [X1,X2,X3] :
( join(join(X1,X2),X3) = X3
=> ( join(X1,X3) = X3
& join(X2,X3) = X3 ) ),
inference(assume_negation,[status(cth)],[goals]) ).
cnf(c_0_53,plain,
join(X1,join(X1,X2)) = join(X1,X2),
inference(spm,[status(thm)],[c_0_43,c_0_51]) ).
fof(c_0_54,negated_conjecture,
( join(join(esk1_0,esk2_0),esk3_0) = esk3_0
& ( join(esk1_0,esk3_0) != esk3_0
| join(esk2_0,esk3_0) != esk3_0 ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_52])])]) ).
cnf(c_0_55,plain,
join(X1,join(X2,X1)) = join(X2,X1),
inference(spm,[status(thm)],[c_0_53,c_0_26]) ).
cnf(c_0_56,negated_conjecture,
join(join(esk1_0,esk2_0),esk3_0) = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_54]) ).
cnf(c_0_57,negated_conjecture,
( join(esk1_0,esk3_0) != esk3_0
| join(esk2_0,esk3_0) != esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_54]) ).
cnf(c_0_58,plain,
join(X1,join(X2,join(X1,X3))) = join(X2,join(X1,X3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_55]),c_0_43]),c_0_43]) ).
cnf(c_0_59,negated_conjecture,
join(esk3_0,join(esk1_0,esk2_0)) = esk3_0,
inference(rw,[status(thm)],[c_0_56,c_0_26]) ).
cnf(c_0_60,negated_conjecture,
( join(esk3_0,esk1_0) != esk3_0
| join(esk3_0,esk2_0) != esk3_0 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_57,c_0_26]),c_0_26]) ).
cnf(c_0_61,negated_conjecture,
join(esk3_0,esk1_0) = esk3_0,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_26]) ).
cnf(c_0_62,negated_conjecture,
join(esk3_0,join(esk1_0,join(esk2_0,X1))) = join(esk3_0,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_59]),c_0_43]) ).
cnf(c_0_63,negated_conjecture,
join(esk3_0,esk2_0) != esk3_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_60,c_0_61])]) ).
cnf(c_0_64,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_51]),c_0_59]),c_0_63]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : REL048+1 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.35 % Computer : n007.cluster.edu
% 0.12/0.35 % Model : x86_64 x86_64
% 0.12/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.35 % Memory : 8042.1875MB
% 0.12/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.35 % CPULimit : 300
% 0.12/0.35 % WCLimit : 600
% 0.12/0.35 % DateTime : Fri Jul 8 14:56:17 EDT 2022
% 0.12/0.35 % CPUTime :
% 0.20/0.46 # ENIGMATIC: Selected SinE mode:
% 0.20/0.47 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.47 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.20/0.47 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.20/0.47 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 8.47/2.50 # ENIGMATIC: Solved by autoschedule:
% 8.47/2.50 # No SInE strategy applied
% 8.47/2.50 # Trying AutoSched0 for 150 seconds
% 8.47/2.50 # AutoSched0-Mode selected heuristic H_____047_C09_12_F1_AE_ND_CS_SP_S5PRR_RG_S04AN
% 8.47/2.50 # and selection function SelectComplexExceptUniqMaxHorn.
% 8.47/2.50 #
% 8.47/2.50 # Preprocessing time : 0.025 s
% 8.47/2.50 # Presaturation interreduction done
% 8.47/2.50
% 8.47/2.50 # Proof found!
% 8.47/2.50 # SZS status Theorem
% 8.47/2.50 # SZS output start CNFRefutation
% See solution above
% 8.47/2.50 # Training examples: 0 positive, 0 negative
% 8.47/2.50
% 8.47/2.50 # -------------------------------------------------
% 8.47/2.50 # User time : 0.037 s
% 8.47/2.50 # System time : 0.008 s
% 8.47/2.50 # Total time : 0.045 s
% 8.47/2.50 # Maximum resident set size: 7120 pages
% 8.47/2.50
%------------------------------------------------------------------------------