TSTP Solution File: SET928+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SET928+1 : TPTP v8.1.0. Released v3.2.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 : Tue Jul 19 00:15:20 EDT 2022
% Result : Theorem 6.77s 2.91s
% Output : CNFRefutation 6.77s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of clauses : 24 ( 5 unt; 6 nHn; 19 RR)
% Number of literals : 48 ( 15 equ; 22 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 36 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_6,plain,
( ~ in(X1,X2)
| ~ disjoint(unordered_pair(X1,X3),X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-7rq7lpvx/lgb.p',i_0_6) ).
cnf(i_0_2,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-7rq7lpvx/lgb.p',i_0_2) ).
cnf(i_0_12,plain,
( set_difference(X1,X2) = X1
| ~ disjoint(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-7rq7lpvx/lgb.p',i_0_12) ).
cnf(i_0_7,plain,
( in(X1,X2)
| in(X3,X2)
| disjoint(unordered_pair(X3,X1),X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-7rq7lpvx/lgb.p',i_0_7) ).
cnf(i_0_11,plain,
( disjoint(X1,X2)
| set_difference(X1,X2) != X1 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-7rq7lpvx/lgb.p',i_0_11) ).
cnf(i_0_10,negated_conjecture,
( in(esk3_0,esk5_0)
| in(esk4_0,esk5_0)
| set_difference(unordered_pair(esk3_0,esk4_0),esk5_0) != unordered_pair(esk3_0,esk4_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-7rq7lpvx/lgb.p',i_0_10) ).
cnf(i_0_9,negated_conjecture,
( set_difference(unordered_pair(esk3_0,esk4_0),esk5_0) = unordered_pair(esk3_0,esk4_0)
| ~ in(esk3_0,esk5_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-7rq7lpvx/lgb.p',i_0_9) ).
cnf(i_0_8,negated_conjecture,
( set_difference(unordered_pair(esk3_0,esk4_0),esk5_0) = unordered_pair(esk3_0,esk4_0)
| ~ in(esk4_0,esk5_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-7rq7lpvx/lgb.p',i_0_8) ).
cnf(c_0_21,plain,
( ~ in(X1,X2)
| ~ disjoint(unordered_pair(X1,X3),X2) ),
i_0_6 ).
cnf(c_0_22,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
i_0_2 ).
cnf(c_0_23,plain,
( set_difference(X1,X2) = X1
| ~ disjoint(X1,X2) ),
i_0_12 ).
cnf(c_0_24,plain,
( in(X1,X2)
| in(X3,X2)
| disjoint(unordered_pair(X3,X1),X2) ),
i_0_7 ).
cnf(c_0_25,plain,
( disjoint(X1,X2)
| set_difference(X1,X2) != X1 ),
i_0_11 ).
cnf(c_0_26,plain,
( ~ disjoint(unordered_pair(X1,X2),X3)
| ~ in(X2,X3) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_27,negated_conjecture,
( in(esk3_0,esk5_0)
| in(esk4_0,esk5_0)
| set_difference(unordered_pair(esk3_0,esk4_0),esk5_0) != unordered_pair(esk3_0,esk4_0) ),
i_0_10 ).
cnf(c_0_28,plain,
( set_difference(unordered_pair(X1,X2),X3) = unordered_pair(X1,X2)
| in(X1,X3)
| in(X2,X3) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_29,plain,
( set_difference(unordered_pair(X1,X2),X3) != unordered_pair(X1,X2)
| ~ in(X1,X3) ),
inference(spm,[status(thm)],[c_0_21,c_0_25]) ).
cnf(c_0_30,negated_conjecture,
( set_difference(unordered_pair(esk3_0,esk4_0),esk5_0) = unordered_pair(esk3_0,esk4_0)
| ~ in(esk3_0,esk5_0) ),
i_0_9 ).
cnf(c_0_31,plain,
( set_difference(unordered_pair(X1,X2),X3) != unordered_pair(X1,X2)
| ~ in(X2,X3) ),
inference(spm,[status(thm)],[c_0_26,c_0_25]) ).
cnf(c_0_32,negated_conjecture,
( set_difference(unordered_pair(esk3_0,esk4_0),esk5_0) = unordered_pair(esk3_0,esk4_0)
| ~ in(esk4_0,esk5_0) ),
i_0_8 ).
cnf(c_0_33,negated_conjecture,
( in(esk3_0,esk5_0)
| in(esk4_0,esk5_0) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_34,negated_conjecture,
~ in(esk3_0,esk5_0),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_35,negated_conjecture,
~ in(esk4_0,esk5_0),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_36,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_33,c_0_34]),c_0_35]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : SET928+1 : TPTP v8.1.0. Released v3.2.0.
% 0.00/0.10 % Command : enigmatic-eprover.py %s %d 1
% 0.09/0.30 % Computer : n007.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 300
% 0.09/0.30 % WCLimit : 600
% 0.09/0.30 % DateTime : Sun Jul 10 18:31:03 EDT 2022
% 0.09/0.30 % CPUTime :
% 0.15/0.41 # ENIGMATIC: Selected complete mode:
% 6.77/2.91 # ENIGMATIC: Solved by autoschedule-lgb:
% 6.77/2.91 # No SInE strategy applied
% 6.77/2.91 # Trying AutoSched0 for 150 seconds
% 6.77/2.91 # AutoSched0-Mode selected heuristic G_E___302_C18_F1_URBAN_S0Y
% 6.77/2.91 # and selection function SelectMaxLComplexAvoidPosPred.
% 6.77/2.91 #
% 6.77/2.91 # Preprocessing time : 0.012 s
% 6.77/2.91
% 6.77/2.91 # Proof found!
% 6.77/2.91 # SZS status Theorem
% 6.77/2.91 # SZS output start CNFRefutation
% See solution above
% 6.77/2.91 # Training examples: 0 positive, 0 negative
% 6.77/2.91
% 6.77/2.91 # -------------------------------------------------
% 6.77/2.91 # User time : 0.013 s
% 6.77/2.91 # System time : 0.004 s
% 6.77/2.91 # Total time : 0.017 s
% 6.77/2.91 # Maximum resident set size: 7124 pages
% 6.77/2.91
%------------------------------------------------------------------------------