TSTP Solution File: SET959+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SET959+1 : TPTP v8.1.0. Bugfixed v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n023.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:31 EDT 2022
% Result : Theorem 7.26s 2.36s
% Output : CNFRefutation 7.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of clauses : 26 ( 8 unt; 4 nHn; 20 RR)
% Number of literals : 50 ( 18 equ; 18 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 2 con; 0-2 aty)
% Number of variables : 32 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_11,negated_conjecture,
( unordered_pair(unordered_pair(esk5_1(X1),esk6_1(X1)),singleton(esk5_1(X1))) = X1
| ~ in(X1,esk3_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xxigbcxc/lgb.p',i_0_11) ).
cnf(i_0_2,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xxigbcxc/lgb.p',i_0_2) ).
cnf(i_0_9,negated_conjecture,
( in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),esk4_0)
| ~ in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),esk3_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xxigbcxc/lgb.p',i_0_9) ).
cnf(i_0_12,plain,
( X1 = X2
| in(esk9_2(X1,X2),X2)
| in(esk9_2(X1,X2),X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xxigbcxc/lgb.p',i_0_12) ).
cnf(i_0_10,negated_conjecture,
( unordered_pair(unordered_pair(esk7_1(X1),esk8_1(X1)),singleton(esk7_1(X1))) = X1
| ~ in(X1,esk4_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xxigbcxc/lgb.p',i_0_10) ).
cnf(i_0_7,negated_conjecture,
esk4_0 != esk3_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xxigbcxc/lgb.p',i_0_7) ).
cnf(i_0_8,negated_conjecture,
( in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),esk3_0)
| ~ in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),esk4_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xxigbcxc/lgb.p',i_0_8) ).
cnf(i_0_13,plain,
( X1 = X2
| ~ in(esk9_2(X1,X2),X2)
| ~ in(esk9_2(X1,X2),X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xxigbcxc/lgb.p',i_0_13) ).
cnf(c_0_22,negated_conjecture,
( unordered_pair(unordered_pair(esk5_1(X1),esk6_1(X1)),singleton(esk5_1(X1))) = X1
| ~ in(X1,esk3_0) ),
i_0_11 ).
cnf(c_0_23,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
i_0_2 ).
cnf(c_0_24,negated_conjecture,
( in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),esk4_0)
| ~ in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),esk3_0) ),
i_0_9 ).
cnf(c_0_25,negated_conjecture,
( unordered_pair(singleton(esk5_1(X1)),unordered_pair(esk5_1(X1),esk6_1(X1))) = X1
| ~ in(X1,esk3_0) ),
inference(rw,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_26,plain,
( X1 = X2
| in(esk9_2(X1,X2),X2)
| in(esk9_2(X1,X2),X1) ),
i_0_12 ).
cnf(c_0_27,plain,
( in(unordered_pair(singleton(X1),unordered_pair(X1,X2)),esk4_0)
| ~ in(unordered_pair(singleton(X1),unordered_pair(X1,X2)),esk3_0) ),
inference(spm,[status(thm)],[c_0_24,c_0_23]) ).
cnf(c_0_28,negated_conjecture,
( unordered_pair(singleton(esk5_1(esk9_2(X1,esk3_0))),unordered_pair(esk5_1(esk9_2(X1,esk3_0)),esk6_1(esk9_2(X1,esk3_0)))) = esk9_2(X1,esk3_0)
| X1 = esk3_0
| in(esk9_2(X1,esk3_0),X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_29,negated_conjecture,
( unordered_pair(unordered_pair(esk7_1(X1),esk8_1(X1)),singleton(esk7_1(X1))) = X1
| ~ in(X1,esk4_0) ),
i_0_10 ).
cnf(c_0_30,plain,
( X1 = esk3_0
| in(esk9_2(X1,esk3_0),esk4_0)
| in(esk9_2(X1,esk3_0),X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_26]) ).
cnf(c_0_31,negated_conjecture,
esk4_0 != esk3_0,
i_0_7 ).
cnf(c_0_32,negated_conjecture,
( in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),esk3_0)
| ~ in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),esk4_0) ),
i_0_8 ).
cnf(c_0_33,negated_conjecture,
( unordered_pair(singleton(esk7_1(X1)),unordered_pair(esk7_1(X1),esk8_1(X1))) = X1
| ~ in(X1,esk4_0) ),
inference(rw,[status(thm)],[c_0_29,c_0_23]) ).
cnf(c_0_34,plain,
in(esk9_2(esk4_0,esk3_0),esk4_0),
inference(sr,[status(thm)],[inference(ef,[status(thm)],[c_0_30]),c_0_31]) ).
cnf(c_0_35,plain,
( in(unordered_pair(singleton(X1),unordered_pair(X1,X2)),esk3_0)
| ~ in(unordered_pair(singleton(X1),unordered_pair(X1,X2)),esk4_0) ),
inference(spm,[status(thm)],[c_0_32,c_0_23]) ).
cnf(c_0_36,negated_conjecture,
unordered_pair(singleton(esk7_1(esk9_2(esk4_0,esk3_0))),unordered_pair(esk7_1(esk9_2(esk4_0,esk3_0)),esk8_1(esk9_2(esk4_0,esk3_0)))) = esk9_2(esk4_0,esk3_0),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_37,plain,
( X1 = X2
| ~ in(esk9_2(X1,X2),X2)
| ~ in(esk9_2(X1,X2),X1) ),
i_0_13 ).
cnf(c_0_38,plain,
in(esk9_2(esk4_0,esk3_0),esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_34])]) ).
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_34])]),c_0_31]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SET959+1 : TPTP v8.1.0. Bugfixed v4.0.0.
% 0.11/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n023.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 17:29:27 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected complete mode:
% 7.26/2.36 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.26/2.36 # No SInE strategy applied
% 7.26/2.36 # Trying AutoSched0 for 150 seconds
% 7.26/2.36 # AutoSched0-Mode selected heuristic G_E___008_C45_F1_PI_AE_Q4_CS_SP_S4c
% 7.26/2.36 # and selection function SelectCQPrecWNTNp.
% 7.26/2.36 #
% 7.26/2.36 # Preprocessing time : 0.023 s
% 7.26/2.36
% 7.26/2.36 # Proof found!
% 7.26/2.36 # SZS status Theorem
% 7.26/2.36 # SZS output start CNFRefutation
% See solution above
% 7.26/2.36 # Training examples: 0 positive, 0 negative
% 7.26/2.36
% 7.26/2.36 # -------------------------------------------------
% 7.26/2.36 # User time : 0.025 s
% 7.26/2.36 # System time : 0.004 s
% 7.26/2.36 # Total time : 0.030 s
% 7.26/2.36 # Maximum resident set size: 7124 pages
% 7.26/2.36
%------------------------------------------------------------------------------