TSTP Solution File: SET047+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SET047+1 : TPTP v8.1.0. Released v2.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 : Tue Jul 19 00:08:40 EDT 2022
% Result : Theorem 8.74s 2.57s
% Output : CNFRefutation 8.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 6
% Syntax : Number of clauses : 23 ( 4 unt; 7 nHn; 19 RR)
% Number of literals : 53 ( 0 equ; 22 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 25 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_4,plain,
( element(X1,X2)
| ~ set_equal(X3,X2)
| ~ element(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-uvo51sov/lgb.p',i_0_4) ).
cnf(i_0_5,negated_conjecture,
( set_equal(esk2_0,esk3_0)
| set_equal(esk3_0,esk2_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-uvo51sov/lgb.p',i_0_5) ).
cnf(i_0_3,plain,
( element(X1,X2)
| ~ set_equal(X2,X3)
| ~ element(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-uvo51sov/lgb.p',i_0_3) ).
cnf(i_0_1,plain,
( set_equal(X1,X2)
| element(esk1_2(X1,X2),X2)
| element(esk1_2(X1,X2),X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-uvo51sov/lgb.p',i_0_1) ).
cnf(i_0_2,plain,
( set_equal(X1,X2)
| ~ element(esk1_2(X1,X2),X2)
| ~ element(esk1_2(X1,X2),X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-uvo51sov/lgb.p',i_0_2) ).
cnf(i_0_6,negated_conjecture,
( ~ set_equal(esk2_0,esk3_0)
| ~ set_equal(esk3_0,esk2_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-uvo51sov/lgb.p',i_0_6) ).
cnf(c_0_13,plain,
( element(X1,X2)
| ~ set_equal(X3,X2)
| ~ element(X1,X3) ),
i_0_4 ).
cnf(c_0_14,negated_conjecture,
( set_equal(esk2_0,esk3_0)
| set_equal(esk3_0,esk2_0) ),
i_0_5 ).
cnf(c_0_15,plain,
( element(X1,X2)
| ~ set_equal(X2,X3)
| ~ element(X1,X3) ),
i_0_3 ).
cnf(c_0_16,negated_conjecture,
( element(X1,esk3_0)
| ~ element(X1,esk2_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]) ).
cnf(c_0_17,plain,
( set_equal(X1,X2)
| element(esk1_2(X1,X2),X2)
| element(esk1_2(X1,X2),X1) ),
i_0_1 ).
cnf(c_0_18,plain,
( element(esk1_2(esk2_0,X1),esk3_0)
| element(esk1_2(esk2_0,X1),X1)
| set_equal(esk2_0,X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_19,plain,
( set_equal(X1,X2)
| ~ element(esk1_2(X1,X2),X2)
| ~ element(esk1_2(X1,X2),X1) ),
i_0_2 ).
cnf(c_0_20,plain,
( element(esk1_2(esk2_0,esk3_0),esk3_0)
| set_equal(esk2_0,esk3_0) ),
inference(ef,[status(thm)],[c_0_18]) ).
cnf(c_0_21,plain,
( set_equal(esk2_0,esk3_0)
| ~ element(esk1_2(esk2_0,esk3_0),esk2_0) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_22,negated_conjecture,
( element(X1,esk2_0)
| ~ element(X1,esk3_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_14]),c_0_13]) ).
cnf(c_0_23,negated_conjecture,
( ~ set_equal(esk2_0,esk3_0)
| ~ set_equal(esk3_0,esk2_0) ),
i_0_6 ).
cnf(c_0_24,negated_conjecture,
set_equal(esk2_0,esk3_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_20]) ).
cnf(c_0_25,plain,
( element(esk1_2(X1,esk2_0),esk3_0)
| element(esk1_2(X1,esk2_0),X1)
| set_equal(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_26,negated_conjecture,
~ set_equal(esk3_0,esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24])]) ).
cnf(c_0_27,plain,
( set_equal(X1,esk2_0)
| ~ element(esk1_2(X1,esk2_0),esk3_0)
| ~ element(esk1_2(X1,esk2_0),X1) ),
inference(spm,[status(thm)],[c_0_19,c_0_22]) ).
cnf(c_0_28,plain,
element(esk1_2(esk3_0,esk2_0),esk3_0),
inference(sr,[status(thm)],[inference(ef,[status(thm)],[c_0_25]),c_0_26]) ).
cnf(c_0_29,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_28])]),c_0_26]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET047+1 : TPTP v8.1.0. Released v2.0.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.14/0.34 % Computer : n012.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Sun Jul 10 18:04:45 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.20/0.45 # ENIGMATIC: Selected complete mode:
% 8.74/2.57 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.74/2.57 # No SInE strategy applied
% 8.74/2.57 # Trying AutoSched0 for 150 seconds
% 8.74/2.57 # AutoSched0-Mode selected heuristic G_E___041_C18_F1_PI_AE_Q4_CS_SP_S0Y
% 8.74/2.57 # and selection function SelectMaxLComplexAvoidPosPred.
% 8.74/2.57 #
% 8.74/2.57 # Preprocessing time : 0.022 s
% 8.74/2.57
% 8.74/2.57 # Proof found!
% 8.74/2.57 # SZS status Theorem
% 8.74/2.57 # SZS output start CNFRefutation
% See solution above
% 8.74/2.57 # Training examples: 0 positive, 0 negative
% 8.74/2.57
% 8.74/2.57 # -------------------------------------------------
% 8.74/2.57 # User time : 0.020 s
% 8.74/2.57 # System time : 0.009 s
% 8.74/2.57 # Total time : 0.028 s
% 8.74/2.57 # Maximum resident set size: 7124 pages
% 8.74/2.57
%------------------------------------------------------------------------------