TSTP Solution File: SET962+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SET962+1 : TPTP v8.1.0. Bugfixed v4.0.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:33 EDT 2022
% Result : Theorem 7.82s 2.49s
% Output : CNFRefutation 7.82s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 8
% Syntax : Number of clauses : 26 ( 10 unt; 5 nHn; 19 RR)
% Number of literals : 54 ( 14 equ; 18 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 51 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_6,plain,
( in(X1,X2)
| ~ in(unordered_pair(unordered_pair(X3,X1),singleton(X3)),cartesian_product2(X4,X2)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lxbu9lcy/lgb.p',i_0_6) ).
cnf(i_0_11,negated_conjecture,
cartesian_product2(esk3_0,esk3_0) = cartesian_product2(esk4_0,esk4_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lxbu9lcy/lgb.p',i_0_11) ).
cnf(i_0_5,plain,
( in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),cartesian_product2(X3,X4))
| ~ in(X2,X4)
| ~ in(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lxbu9lcy/lgb.p',i_0_5) ).
cnf(i_0_12,plain,
( X1 = X2
| in(esk5_2(X1,X2),X2)
| in(esk5_2(X1,X2),X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lxbu9lcy/lgb.p',i_0_12) ).
cnf(i_0_2,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lxbu9lcy/lgb.p',i_0_2) ).
cnf(i_0_10,negated_conjecture,
esk3_0 != esk4_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lxbu9lcy/lgb.p',i_0_10) ).
cnf(i_0_7,plain,
( in(X1,X2)
| ~ in(unordered_pair(unordered_pair(X1,X3),singleton(X1)),cartesian_product2(X2,X4)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lxbu9lcy/lgb.p',i_0_7) ).
cnf(i_0_13,plain,
( X1 = X2
| ~ in(esk5_2(X1,X2),X2)
| ~ in(esk5_2(X1,X2),X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lxbu9lcy/lgb.p',i_0_13) ).
cnf(c_0_22,plain,
( in(X1,X2)
| ~ in(unordered_pair(unordered_pair(X3,X1),singleton(X3)),cartesian_product2(X4,X2)) ),
i_0_6 ).
cnf(c_0_23,negated_conjecture,
cartesian_product2(esk3_0,esk3_0) = cartesian_product2(esk4_0,esk4_0),
i_0_11 ).
cnf(c_0_24,plain,
( in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),cartesian_product2(X3,X4))
| ~ in(X2,X4)
| ~ in(X1,X3) ),
i_0_5 ).
cnf(c_0_25,plain,
( X1 = X2
| in(esk5_2(X1,X2),X2)
| in(esk5_2(X1,X2),X1) ),
i_0_12 ).
cnf(c_0_26,negated_conjecture,
( in(X1,esk3_0)
| ~ in(unordered_pair(unordered_pair(X2,X1),singleton(X2)),cartesian_product2(esk4_0,esk4_0)) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_27,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
i_0_2 ).
cnf(c_0_28,plain,
( X1 = X2
| in(unordered_pair(unordered_pair(X3,esk5_2(X1,X2)),singleton(X3)),cartesian_product2(X4,X2))
| in(esk5_2(X1,X2),X1)
| ~ in(X3,X4) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_29,plain,
( in(X1,esk3_0)
| ~ in(unordered_pair(unordered_pair(X1,X2),singleton(X2)),cartesian_product2(esk4_0,esk4_0)) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_30,plain,
( X1 = X2
| X3 = X4
| in(unordered_pair(unordered_pair(esk5_2(X1,X2),esk5_2(X3,X4)),singleton(esk5_2(X1,X2))),cartesian_product2(X2,X4))
| in(esk5_2(X1,X2),X1)
| in(esk5_2(X3,X4),X3) ),
inference(spm,[status(thm)],[c_0_28,c_0_25]) ).
cnf(c_0_31,plain,
( X1 = esk4_0
| in(esk5_2(X1,esk4_0),esk3_0)
| in(esk5_2(X1,esk4_0),X1) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_32,negated_conjecture,
esk3_0 != esk4_0,
i_0_10 ).
cnf(c_0_33,plain,
in(esk5_2(esk3_0,esk4_0),esk3_0),
inference(sr,[status(thm)],[inference(ef,[status(thm)],[c_0_31]),c_0_32]) ).
cnf(c_0_34,plain,
( in(unordered_pair(unordered_pair(X1,esk5_2(esk3_0,esk4_0)),singleton(X1)),cartesian_product2(X2,esk3_0))
| ~ in(X1,X2) ),
inference(spm,[status(thm)],[c_0_24,c_0_33]) ).
cnf(c_0_35,plain,
( in(X1,X2)
| ~ in(unordered_pair(unordered_pair(X1,X3),singleton(X1)),cartesian_product2(X2,X4)) ),
i_0_7 ).
cnf(c_0_36,plain,
in(unordered_pair(unordered_pair(esk5_2(esk3_0,esk4_0),esk5_2(esk3_0,esk4_0)),singleton(esk5_2(esk3_0,esk4_0))),cartesian_product2(esk4_0,esk4_0)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_33]),c_0_23]) ).
cnf(c_0_37,plain,
( X1 = X2
| ~ in(esk5_2(X1,X2),X2)
| ~ in(esk5_2(X1,X2),X1) ),
i_0_13 ).
cnf(c_0_38,plain,
in(esk5_2(esk3_0,esk4_0),esk4_0),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_39,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_33])]),c_0_32]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : SET962+1 : TPTP v8.1.0. Bugfixed v4.0.0.
% 0.12/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.14/0.34 % Computer : n014.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 : Sat Jul 9 18:39:52 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.21/0.46 # ENIGMATIC: Selected complete mode:
% 7.82/2.49 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.82/2.49 # No SInE strategy applied
% 7.82/2.49 # Trying AutoSched0 for 150 seconds
% 7.82/2.49 # AutoSched0-Mode selected heuristic G_E___024_B31_F1_PI_AE_Q4_CS_SP_S2S
% 7.82/2.49 # and selection function SelectNewComplexAHP.
% 7.82/2.49 #
% 7.82/2.49 # Preprocessing time : 0.023 s
% 7.82/2.49
% 7.82/2.49 # Proof found!
% 7.82/2.49 # SZS status Theorem
% 7.82/2.49 # SZS output start CNFRefutation
% See solution above
% 7.82/2.49 # Training examples: 0 positive, 0 negative
% 7.82/2.49
% 7.82/2.49 # -------------------------------------------------
% 7.82/2.49 # User time : 0.025 s
% 7.82/2.49 # System time : 0.007 s
% 7.82/2.49 # Total time : 0.032 s
% 7.82/2.49 # Maximum resident set size: 7124 pages
% 7.82/2.49
%------------------------------------------------------------------------------