TSTP Solution File: SET921+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SET921+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n018.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:15:16 EDT 2022
% Result : Theorem 7.21s 2.23s
% Output : CNFRefutation 7.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of clauses : 28 ( 5 unt; 6 nHn; 25 RR)
% Number of literals : 66 ( 22 equ; 35 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 51 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_11,plain,
( in(X1,X2)
| X3 != set_difference(X2,X4)
| ~ in(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-z973pfvo/lgb.p',i_0_11) ).
cnf(i_0_15,negated_conjecture,
( in(esk5_0,esk6_0)
| in(esk5_0,set_difference(esk6_0,singleton(esk7_0))) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-z973pfvo/lgb.p',i_0_15) ).
cnf(i_0_9,plain,
( in(X1,X2)
| in(X1,X3)
| X2 != set_difference(X4,X3)
| ~ in(X1,X4) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-z973pfvo/lgb.p',i_0_9) ).
cnf(i_0_16,negated_conjecture,
( esk7_0 = esk5_0
| ~ in(esk5_0,esk6_0)
| ~ in(esk5_0,set_difference(esk6_0,singleton(esk7_0))) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-z973pfvo/lgb.p',i_0_16) ).
cnf(i_0_5,plain,
( X1 = X2
| X3 != singleton(X2)
| ~ in(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-z973pfvo/lgb.p',i_0_5) ).
cnf(i_0_4,plain,
( in(X1,X2)
| X1 != X3
| X2 != singleton(X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-z973pfvo/lgb.p',i_0_4) ).
cnf(i_0_10,plain,
( X1 != set_difference(X2,X3)
| ~ in(X4,X1)
| ~ in(X4,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-z973pfvo/lgb.p',i_0_10) ).
cnf(i_0_14,negated_conjecture,
( in(esk5_0,set_difference(esk6_0,singleton(esk7_0)))
| esk7_0 != esk5_0 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-z973pfvo/lgb.p',i_0_14) ).
cnf(c_0_25,plain,
( in(X1,X2)
| X3 != set_difference(X2,X4)
| ~ in(X1,X3) ),
i_0_11 ).
cnf(c_0_26,plain,
( in(X1,X2)
| ~ in(X1,set_difference(X2,X3)) ),
inference(er,[status(thm)],[c_0_25]) ).
cnf(c_0_27,negated_conjecture,
( in(esk5_0,esk6_0)
| in(esk5_0,set_difference(esk6_0,singleton(esk7_0))) ),
i_0_15 ).
cnf(c_0_28,plain,
( in(X1,X2)
| in(X1,X3)
| X2 != set_difference(X4,X3)
| ~ in(X1,X4) ),
i_0_9 ).
cnf(c_0_29,negated_conjecture,
( esk7_0 = esk5_0
| ~ in(esk5_0,esk6_0)
| ~ in(esk5_0,set_difference(esk6_0,singleton(esk7_0))) ),
i_0_16 ).
cnf(c_0_30,negated_conjecture,
in(esk5_0,esk6_0),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_31,plain,
( in(X1,set_difference(X2,X3))
| in(X1,X3)
| ~ in(X1,X2) ),
inference(er,[status(thm)],[c_0_28]) ).
cnf(c_0_32,plain,
( X1 = X2
| X3 != singleton(X2)
| ~ in(X1,X3) ),
i_0_5 ).
cnf(c_0_33,negated_conjecture,
( esk7_0 = esk5_0
| ~ in(esk5_0,set_difference(esk6_0,singleton(esk7_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_30])]) ).
cnf(c_0_34,negated_conjecture,
( in(esk5_0,set_difference(esk6_0,X1))
| in(esk5_0,X1) ),
inference(spm,[status(thm)],[c_0_31,c_0_30]) ).
cnf(c_0_35,plain,
( X1 = X2
| ~ in(X1,singleton(X2)) ),
inference(er,[status(thm)],[c_0_32]) ).
cnf(c_0_36,plain,
( in(X1,X2)
| X1 != X3
| X2 != singleton(X3) ),
i_0_4 ).
cnf(c_0_37,plain,
( X1 != set_difference(X2,X3)
| ~ in(X4,X1)
| ~ in(X4,X3) ),
i_0_10 ).
cnf(c_0_38,negated_conjecture,
( in(esk5_0,set_difference(esk6_0,singleton(esk7_0)))
| esk7_0 != esk5_0 ),
i_0_14 ).
cnf(c_0_39,negated_conjecture,
esk7_0 = esk5_0,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35]) ).
cnf(c_0_40,plain,
( in(X1,X2)
| X2 != singleton(X1) ),
inference(er,[status(thm)],[c_0_36]) ).
cnf(c_0_41,plain,
( ~ in(X1,set_difference(X2,X3))
| ~ in(X1,X3) ),
inference(er,[status(thm)],[c_0_37]) ).
cnf(c_0_42,negated_conjecture,
in(esk5_0,set_difference(esk6_0,singleton(esk5_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_38,c_0_39]),c_0_39])]) ).
cnf(c_0_43,plain,
in(X1,singleton(X1)),
inference(er,[status(thm)],[c_0_40]) ).
cnf(c_0_44,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : SET921+1 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n018.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 : Sun Jul 10 21:03:14 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.43 # ENIGMATIC: Selected complete mode:
% 7.21/2.23 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.21/2.23 # No SInE strategy applied
% 7.21/2.23 # Trying AutoSched0 for 150 seconds
% 7.21/2.23 # AutoSched0-Mode selected heuristic H_____047_C18_F1_PI_AE_R8_CS_SP_S2S
% 7.21/2.23 # and selection function SelectNewComplexAHP.
% 7.21/2.23 #
% 7.21/2.23 # Preprocessing time : 0.024 s
% 7.21/2.23
% 7.21/2.23 # Proof found!
% 7.21/2.23 # SZS status Theorem
% 7.21/2.23 # SZS output start CNFRefutation
% See solution above
% 7.21/2.23 # Training examples: 0 positive, 0 negative
% 7.21/2.23
% 7.21/2.23 # -------------------------------------------------
% 7.21/2.23 # User time : 0.025 s
% 7.21/2.23 # System time : 0.008 s
% 7.21/2.23 # Total time : 0.033 s
% 7.21/2.23 # Maximum resident set size: 7124 pages
% 7.21/2.23
%------------------------------------------------------------------------------