TSTP Solution File: SET583+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SET583+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n012.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:12:25 EDT 2022
% Result : Theorem 8.08s 2.44s
% Output : CNFRefutation 8.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 4
% Syntax : Number of clauses : 9 ( 7 unt; 0 nHn; 9 RR)
% Number of literals : 13 ( 4 equ; 6 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 4 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_1,plain,
( X1 = X2
| ~ subset(X2,X1)
| ~ subset(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-h32y_884/lgb.p',i_0_1) ).
cnf(i_0_10,negated_conjecture,
subset(esk2_0,esk3_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-h32y_884/lgb.p',i_0_10) ).
cnf(i_0_9,negated_conjecture,
subset(esk3_0,esk2_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-h32y_884/lgb.p',i_0_9) ).
cnf(i_0_8,negated_conjecture,
esk3_0 != esk2_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-h32y_884/lgb.p',i_0_8) ).
cnf(c_0_15,plain,
( X1 = X2
| ~ subset(X2,X1)
| ~ subset(X1,X2) ),
i_0_1 ).
cnf(c_0_16,negated_conjecture,
subset(esk2_0,esk3_0),
i_0_10 ).
cnf(c_0_17,negated_conjecture,
subset(esk3_0,esk2_0),
i_0_9 ).
cnf(c_0_18,negated_conjecture,
esk3_0 != esk2_0,
i_0_8 ).
cnf(c_0_19,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]),c_0_18]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET583+3 : TPTP v8.1.0. Released v2.2.0.
% 0.13/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n012.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sat Jul 9 16:32:30 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected complete mode:
% 8.08/2.44 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.08/2.44 # No SInE strategy applied
% 8.08/2.44 # Trying AutoSched0 for 150 seconds
% 8.08/2.44 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 8.08/2.44 # and selection function SelectComplexExceptUniqMaxHorn.
% 8.08/2.44 #
% 8.08/2.44 # Preprocessing time : 0.023 s
% 8.08/2.44 # Presaturation interreduction done
% 8.08/2.44
% 8.08/2.44 # Proof found!
% 8.08/2.44 # SZS status Theorem
% 8.08/2.44 # SZS output start CNFRefutation
% See solution above
% 8.08/2.44 # Training examples: 0 positive, 0 negative
% 8.08/2.44
% 8.08/2.44 # -------------------------------------------------
% 8.08/2.44 # User time : 0.022 s
% 8.08/2.44 # System time : 0.007 s
% 8.08/2.44 # Total time : 0.029 s
% 8.08/2.44 # Maximum resident set size: 7124 pages
% 8.08/2.44
%------------------------------------------------------------------------------