TSTP Solution File: SET956+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SET956+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n025.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:30 EDT 2022
% Result : Theorem 4.41s 2.28s
% Output : CNFRefutation 4.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of clauses : 20 ( 7 unt; 2 nHn; 16 RR)
% Number of literals : 38 ( 5 equ; 18 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 4 con; 0-4 aty)
% Number of variables : 36 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_15,negated_conjecture,
( in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),esk9_0)
| ~ in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),esk6_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bbtadhbs/lgb.p',i_0_15) ).
cnf(i_0_2,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bbtadhbs/lgb.p',i_0_2) ).
cnf(i_0_11,plain,
( unordered_pair(unordered_pair(esk4_4(X1,X2,X3,X4),esk5_4(X1,X2,X3,X4)),singleton(esk4_4(X1,X2,X3,X4))) = X4
| ~ in(X4,X1)
| ~ subset(X1,cartesian_product2(X2,X3)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bbtadhbs/lgb.p',i_0_11) ).
cnf(i_0_16,negated_conjecture,
subset(esk6_0,cartesian_product2(esk7_0,esk8_0)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bbtadhbs/lgb.p',i_0_16) ).
cnf(i_0_3,plain,
( subset(X1,X2)
| ~ in(esk1_2(X1,X2),X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bbtadhbs/lgb.p',i_0_3) ).
cnf(i_0_4,plain,
( subset(X1,X2)
| in(esk1_2(X1,X2),X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bbtadhbs/lgb.p',i_0_4) ).
cnf(i_0_14,negated_conjecture,
~ subset(esk6_0,esk9_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bbtadhbs/lgb.p',i_0_14) ).
cnf(c_0_24,negated_conjecture,
( in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),esk9_0)
| ~ in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),esk6_0) ),
i_0_15 ).
cnf(c_0_25,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
i_0_2 ).
cnf(c_0_26,plain,
( unordered_pair(unordered_pair(esk4_4(X1,X2,X3,X4),esk5_4(X1,X2,X3,X4)),singleton(esk4_4(X1,X2,X3,X4))) = X4
| ~ in(X4,X1)
| ~ subset(X1,cartesian_product2(X2,X3)) ),
i_0_11 ).
cnf(c_0_27,plain,
( in(unordered_pair(singleton(X1),unordered_pair(X1,X2)),esk9_0)
| ~ in(unordered_pair(singleton(X1),unordered_pair(X1,X2)),esk6_0) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_28,plain,
( unordered_pair(singleton(esk4_4(X1,X2,X3,X4)),unordered_pair(esk4_4(X1,X2,X3,X4),esk5_4(X1,X2,X3,X4))) = X4
| ~ subset(X1,cartesian_product2(X2,X3))
| ~ in(X4,X1) ),
inference(rw,[status(thm)],[c_0_26,c_0_25]) ).
cnf(c_0_29,plain,
( in(X1,esk9_0)
| ~ subset(X2,cartesian_product2(X3,X4))
| ~ in(X1,esk6_0)
| ~ in(X1,X2) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_30,negated_conjecture,
subset(esk6_0,cartesian_product2(esk7_0,esk8_0)),
i_0_16 ).
cnf(c_0_31,plain,
( subset(X1,X2)
| ~ in(esk1_2(X1,X2),X2) ),
i_0_3 ).
cnf(c_0_32,negated_conjecture,
( in(X1,esk9_0)
| ~ in(X1,esk6_0) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_33,plain,
( subset(X1,esk9_0)
| ~ in(esk1_2(X1,esk9_0),esk6_0) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_34,plain,
( subset(X1,X2)
| in(esk1_2(X1,X2),X1) ),
i_0_4 ).
cnf(c_0_35,negated_conjecture,
~ subset(esk6_0,esk9_0),
i_0_14 ).
cnf(c_0_36,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : SET956+1 : TPTP v8.1.0. Released v3.2.0.
% 0.10/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n025.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 : Mon Jul 11 01:49:33 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected complete mode:
% 4.41/2.28 # ENIGMATIC: Solved by autoschedule-lgb:
% 4.41/2.28 # No SInE strategy applied
% 4.41/2.28 # Trying AutoSched0 for 150 seconds
% 4.41/2.28 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 4.41/2.28 # and selection function SelectComplexExceptUniqMaxHorn.
% 4.41/2.28 #
% 4.41/2.28 # Preprocessing time : 0.022 s
% 4.41/2.28 # Presaturation interreduction done
% 4.41/2.28
% 4.41/2.28 # Proof found!
% 4.41/2.28 # SZS status Theorem
% 4.41/2.28 # SZS output start CNFRefutation
% See solution above
% 4.41/2.28 # Training examples: 0 positive, 0 negative
% 4.41/2.28
% 4.41/2.28 # -------------------------------------------------
% 4.41/2.28 # User time : 0.024 s
% 4.41/2.28 # System time : 0.004 s
% 4.41/2.28 # Total time : 0.029 s
% 4.41/2.28 # Maximum resident set size: 7128 pages
% 4.41/2.28
%------------------------------------------------------------------------------