TSTP Solution File: REL001+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : REL001+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n012.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:12:47 EDT 2022
% Result : Theorem 5.25s 2.15s
% Output : CNFRefutation 5.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 10
% Syntax : Number of clauses : 35 ( 35 unt; 0 nHn; 7 RR)
% Number of literals : 35 ( 34 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 43 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_7,plain,
composition(converse(X1),converse(X2)) = converse(composition(X2,X1)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3kz3sn6c/lgb.p',i_0_7) ).
cnf(i_0_6,plain,
converse(converse(X1)) = X1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3kz3sn6c/lgb.p',i_0_6) ).
cnf(i_0_3,plain,
composition(X1,one) = X1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3kz3sn6c/lgb.p',i_0_3) ).
cnf(i_0_5,plain,
join(composition(converse(X1),complement(composition(X1,X2))),complement(X2)) = complement(X2),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3kz3sn6c/lgb.p',i_0_5) ).
cnf(i_0_11,plain,
join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3kz3sn6c/lgb.p',i_0_11) ).
cnf(i_0_9,plain,
complement(join(complement(X1),complement(complement(X1)))) = zero,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3kz3sn6c/lgb.p',i_0_9) ).
cnf(i_0_8,plain,
join(X1,complement(X1)) = top,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3kz3sn6c/lgb.p',i_0_8) ).
cnf(i_0_13,plain,
join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2))) = X1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3kz3sn6c/lgb.p',i_0_13) ).
cnf(i_0_12,plain,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3kz3sn6c/lgb.p',i_0_12) ).
cnf(i_0_10,negated_conjecture,
join(zero,esk1_0) != esk1_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3kz3sn6c/lgb.p',i_0_10) ).
cnf(c_0_24,plain,
composition(converse(X1),converse(X2)) = converse(composition(X2,X1)),
i_0_7 ).
cnf(c_0_25,plain,
converse(converse(X1)) = X1,
i_0_6 ).
cnf(c_0_26,plain,
converse(composition(converse(X1),X2)) = composition(converse(X2),X1),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_27,plain,
composition(X1,one) = X1,
i_0_3 ).
cnf(c_0_28,plain,
composition(converse(one),X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_25]) ).
cnf(c_0_29,plain,
join(composition(converse(X1),complement(composition(X1,X2))),complement(X2)) = complement(X2),
i_0_5 ).
cnf(c_0_30,plain,
join(X1,X2) = join(X2,X1),
i_0_11 ).
cnf(c_0_31,plain,
converse(one) = one,
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_32,plain,
join(complement(X1),composition(converse(X2),complement(composition(X2,X1)))) = complement(X1),
inference(rw,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_33,plain,
composition(one,X1) = X1,
inference(rw,[status(thm)],[c_0_28,c_0_31]) ).
cnf(c_0_34,plain,
complement(join(complement(X1),complement(complement(X1)))) = zero,
i_0_9 ).
cnf(c_0_35,plain,
join(X1,complement(X1)) = top,
i_0_8 ).
cnf(c_0_36,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_31]),c_0_33]) ).
cnf(c_0_37,plain,
complement(top) = zero,
inference(rw,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_38,plain,
join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2))) = X1,
i_0_13 ).
cnf(c_0_39,plain,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
i_0_12 ).
cnf(c_0_40,plain,
join(zero,zero) = zero,
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_41,plain,
join(complement(join(complement(X1),X2)),complement(join(complement(X1),complement(X2)))) = X1,
inference(rw,[status(thm)],[c_0_38,c_0_30]) ).
cnf(c_0_42,plain,
join(zero,join(zero,X1)) = join(zero,X1),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_43,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_41,c_0_35]),c_0_36]),c_0_37]),c_0_30]) ).
cnf(c_0_44,negated_conjecture,
join(zero,esk1_0) != esk1_0,
i_0_10 ).
cnf(c_0_45,plain,
join(zero,X1) = X1,
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_46,negated_conjecture,
join(esk1_0,zero) != esk1_0,
inference(rw,[status(thm)],[c_0_44,c_0_30]) ).
cnf(c_0_47,plain,
join(X1,zero) = X1,
inference(spm,[status(thm)],[c_0_30,c_0_45]) ).
cnf(c_0_48,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_46,c_0_47])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : REL001+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n012.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Fri Jul 8 11:04:31 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.39 # ENIGMATIC: Selected SinE mode:
% 0.19/0.40 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.40 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.40 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.40 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 5.25/2.15 # ENIGMATIC: Solved by autoschedule-lgb:
% 5.25/2.15 # No SInE strategy applied
% 5.25/2.15 # Trying AutoSched0 for 150 seconds
% 5.25/2.15 # AutoSched0-Mode selected heuristic H_____047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S
% 5.25/2.15 # and selection function SelectNewComplexAHP.
% 5.25/2.15 #
% 5.25/2.15 # Preprocessing time : 0.012 s
% 5.25/2.15 # Presaturation interreduction done
% 5.25/2.15
% 5.25/2.15 # Proof found!
% 5.25/2.15 # SZS status Theorem
% 5.25/2.15 # SZS output start CNFRefutation
% See solution above
% 5.25/2.15 # Training examples: 0 positive, 0 negative
% 5.25/2.15
% 5.25/2.15 # -------------------------------------------------
% 5.25/2.15 # User time : 0.010 s
% 5.25/2.15 # System time : 0.009 s
% 5.25/2.15 # Total time : 0.019 s
% 5.25/2.15 # Maximum resident set size: 7128 pages
% 5.25/2.15
%------------------------------------------------------------------------------