TSTP Solution File: SET916+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SET916+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n014.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:13 EDT 2022
% Result : Theorem 7.75s 2.24s
% Output : CNFRefutation 7.75s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of clauses : 25 ( 13 unt; 6 nHn; 21 RR)
% Number of literals : 46 ( 17 equ; 21 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 41 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_14,plain,
( in(X1,X2)
| X3 != set_intersection2(X4,X2)
| ~ in(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-835rj185/input.p',i_0_14) ).
cnf(i_0_22,negated_conjecture,
~ disjoint(unordered_pair(esk6_0,esk8_0),esk7_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-835rj185/input.p',i_0_22) ).
cnf(i_0_21,plain,
( disjoint(X1,X2)
| in(esk5_2(X1,X2),set_intersection2(X1,X2)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-835rj185/input.p',i_0_21) ).
cnf(i_0_3,plain,
set_intersection2(X1,X2) = set_intersection2(X2,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-835rj185/input.p',i_0_3) ).
cnf(i_0_15,plain,
( in(X1,X2)
| X3 != set_intersection2(X2,X4)
| ~ in(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-835rj185/input.p',i_0_15) ).
cnf(i_0_9,plain,
( X1 = X2
| X1 = X3
| X4 != unordered_pair(X3,X2)
| ~ in(X1,X4) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-835rj185/input.p',i_0_9) ).
cnf(i_0_23,negated_conjecture,
~ in(esk8_0,esk7_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-835rj185/input.p',i_0_23) ).
cnf(i_0_24,negated_conjecture,
~ in(esk6_0,esk7_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-835rj185/input.p',i_0_24) ).
cnf(c_0_33,plain,
( in(X1,X2)
| X3 != set_intersection2(X4,X2)
| ~ in(X1,X3) ),
i_0_14 ).
cnf(c_0_34,negated_conjecture,
~ disjoint(unordered_pair(esk6_0,esk8_0),esk7_0),
i_0_22 ).
cnf(c_0_35,plain,
( disjoint(X1,X2)
| in(esk5_2(X1,X2),set_intersection2(X1,X2)) ),
i_0_21 ).
cnf(c_0_36,plain,
set_intersection2(X1,X2) = set_intersection2(X2,X1),
i_0_3 ).
cnf(c_0_37,plain,
( in(X1,X2)
| X3 != set_intersection2(X2,X4)
| ~ in(X1,X3) ),
i_0_15 ).
cnf(c_0_38,plain,
( X1 = X2
| X1 = X3
| X4 != unordered_pair(X3,X2)
| ~ in(X1,X4) ),
i_0_9 ).
cnf(c_0_39,plain,
( in(X1,X2)
| ~ in(X1,set_intersection2(X3,X2)) ),
inference(er,[status(thm)],[c_0_33]) ).
cnf(c_0_40,negated_conjecture,
in(esk5_2(unordered_pair(esk6_0,esk8_0),esk7_0),set_intersection2(esk7_0,unordered_pair(esk6_0,esk8_0))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]) ).
cnf(c_0_41,plain,
( in(X1,X2)
| ~ in(X1,set_intersection2(X2,X3)) ),
inference(er,[status(thm)],[c_0_37]) ).
cnf(c_0_42,plain,
( X1 = X2
| X1 = X3
| ~ in(X1,unordered_pair(X2,X3)) ),
inference(er,[status(thm)],[c_0_38]) ).
cnf(c_0_43,plain,
in(esk5_2(unordered_pair(esk6_0,esk8_0),esk7_0),unordered_pair(esk6_0,esk8_0)),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_44,plain,
in(esk5_2(unordered_pair(esk6_0,esk8_0),esk7_0),esk7_0),
inference(spm,[status(thm)],[c_0_41,c_0_40]) ).
cnf(c_0_45,plain,
( esk5_2(unordered_pair(esk6_0,esk8_0),esk7_0) = esk6_0
| esk5_2(unordered_pair(esk6_0,esk8_0),esk7_0) = esk8_0 ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_46,negated_conjecture,
~ in(esk8_0,esk7_0),
i_0_23 ).
cnf(c_0_47,plain,
esk5_2(unordered_pair(esk6_0,esk8_0),esk7_0) = esk6_0,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_46]) ).
cnf(c_0_48,negated_conjecture,
~ in(esk6_0,esk7_0),
i_0_24 ).
cnf(c_0_49,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_44,c_0_47]),c_0_48]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET916+1 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n014.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % 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 : Mon Jul 11 08:18:36 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.18/0.45 # ENIGMATIC: Selected complete mode:
% 7.75/2.24 # ENIGMATIC: Solved by autoschedule:
% 7.75/2.24 # No SInE strategy applied
% 7.75/2.24 # Trying AutoSched0 for 150 seconds
% 7.75/2.24 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S002A
% 7.75/2.24 # and selection function SelectNegativeLiterals.
% 7.75/2.24 #
% 7.75/2.24 # Preprocessing time : 0.023 s
% 7.75/2.24 # Presaturation interreduction done
% 7.75/2.24
% 7.75/2.24 # Proof found!
% 7.75/2.24 # SZS status Theorem
% 7.75/2.24 # SZS output start CNFRefutation
% See solution above
% 7.75/2.24 # Training examples: 0 positive, 0 negative
% 7.75/2.24
% 7.75/2.24 # -------------------------------------------------
% 7.75/2.24 # User time : 0.028 s
% 7.75/2.24 # System time : 0.002 s
% 7.75/2.24 # Total time : 0.030 s
% 7.75/2.24 # Maximum resident set size: 7120 pages
% 7.75/2.24
%------------------------------------------------------------------------------