TSTP Solution File: REL002+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : REL002+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n005.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 7.66s 2.32s
% Output : CNFRefutation 7.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 8
% Syntax : Number of clauses : 28 ( 28 unt; 0 nHn; 5 RR)
% Number of literals : 28 ( 27 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 : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 36 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_7,plain,
composition(converse(X1),converse(X2)) = converse(composition(X2,X1)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jo2eb90o/lgb.p',i_0_7) ).
cnf(i_0_6,plain,
converse(converse(X1)) = X1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jo2eb90o/lgb.p',i_0_6) ).
cnf(i_0_3,plain,
composition(X1,one) = X1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jo2eb90o/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-jo2eb90o/lgb.p',i_0_5) ).
cnf(i_0_11,plain,
join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jo2eb90o/lgb.p',i_0_11) ).
cnf(i_0_12,plain,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jo2eb90o/lgb.p',i_0_12) ).
cnf(i_0_8,plain,
join(X1,complement(X1)) = top,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jo2eb90o/lgb.p',i_0_8) ).
cnf(i_0_10,negated_conjecture,
join(esk1_0,top) != top,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jo2eb90o/lgb.p',i_0_10) ).
cnf(c_0_21,plain,
composition(converse(X1),converse(X2)) = converse(composition(X2,X1)),
i_0_7 ).
cnf(c_0_22,plain,
converse(converse(X1)) = X1,
i_0_6 ).
cnf(c_0_23,plain,
converse(composition(converse(X1),X2)) = composition(converse(X2),X1),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_24,plain,
composition(X1,one) = X1,
i_0_3 ).
cnf(c_0_25,plain,
composition(converse(one),X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_22]) ).
cnf(c_0_26,plain,
join(composition(converse(X1),complement(composition(X1,X2))),complement(X2)) = complement(X2),
i_0_5 ).
cnf(c_0_27,plain,
join(X1,X2) = join(X2,X1),
i_0_11 ).
cnf(c_0_28,plain,
converse(one) = one,
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_29,plain,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
i_0_12 ).
cnf(c_0_30,plain,
join(X1,complement(X1)) = top,
i_0_8 ).
cnf(c_0_31,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_32,plain,
composition(one,X1) = X1,
inference(rw,[status(thm)],[c_0_25,c_0_28]) ).
cnf(c_0_33,plain,
join(X1,join(complement(X1),X2)) = join(top,X2),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_34,plain,
join(complement(X1),complement(X1)) = complement(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_28]),c_0_32]) ).
cnf(c_0_35,plain,
join(top,complement(X1)) = top,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_30]) ).
cnf(c_0_36,negated_conjecture,
join(esk1_0,top) != top,
i_0_10 ).
cnf(c_0_37,plain,
join(X1,top) = top,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_30]),c_0_35]) ).
cnf(c_0_38,negated_conjecture,
join(top,esk1_0) != top,
inference(rw,[status(thm)],[c_0_36,c_0_27]) ).
cnf(c_0_39,plain,
join(top,X1) = top,
inference(spm,[status(thm)],[c_0_27,c_0_37]) ).
cnf(c_0_40,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_38,c_0_39])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : REL002+1 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n005.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.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Fri Jul 8 08:36:23 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected SinE mode:
% 0.19/0.45 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.45 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.45 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.45 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.66/2.32 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.66/2.32 # No SInE strategy applied
% 7.66/2.32 # Trying AutoSched0 for 150 seconds
% 7.66/2.32 # AutoSched0-Mode selected heuristic H_____047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S
% 7.66/2.32 # and selection function SelectNewComplexAHP.
% 7.66/2.32 #
% 7.66/2.32 # Preprocessing time : 0.021 s
% 7.66/2.32 # Presaturation interreduction done
% 7.66/2.32
% 7.66/2.32 # Proof found!
% 7.66/2.32 # SZS status Theorem
% 7.66/2.32 # SZS output start CNFRefutation
% See solution above
% 7.66/2.32 # Training examples: 0 positive, 0 negative
% 7.66/2.32
% 7.66/2.32 # -------------------------------------------------
% 7.66/2.32 # User time : 0.023 s
% 7.66/2.32 # System time : 0.007 s
% 7.66/2.32 # Total time : 0.030 s
% 7.66/2.32 # Maximum resident set size: 7128 pages
% 7.66/2.32
%------------------------------------------------------------------------------