TSTP Solution File: SET899+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SET899+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n005.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:06 EDT 2022
% Result : Theorem 7.64s 2.31s
% Output : CNFRefutation 7.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 4
% Syntax : Number of clauses : 9 ( 7 unt; 2 nHn; 7 RR)
% Number of literals : 13 ( 0 equ; 6 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 6 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_5,negated_conjecture,
~ subset(esk3_0,set_difference(esk4_0,singleton(esk5_0))),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-obws9hq7/input.p',i_0_5) ).
cnf(i_0_8,plain,
( in(X1,X2)
| subset(X2,set_difference(X3,singleton(X1)))
| ~ subset(X2,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-obws9hq7/input.p',i_0_8) ).
cnf(i_0_7,negated_conjecture,
subset(esk3_0,esk4_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-obws9hq7/input.p',i_0_7) ).
cnf(i_0_6,negated_conjecture,
~ in(esk5_0,esk3_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-obws9hq7/input.p',i_0_6) ).
cnf(c_0_13,negated_conjecture,
~ subset(esk3_0,set_difference(esk4_0,singleton(esk5_0))),
i_0_5 ).
cnf(c_0_14,plain,
( in(X1,X2)
| subset(X2,set_difference(X3,singleton(X1)))
| ~ subset(X2,X3) ),
i_0_8 ).
cnf(c_0_15,negated_conjecture,
subset(esk3_0,esk4_0),
i_0_7 ).
cnf(c_0_16,negated_conjecture,
~ in(esk5_0,esk3_0),
i_0_6 ).
cnf(c_0_17,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15])]),c_0_16]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET899+1 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.11/0.33 % Computer : n005.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 600
% 0.11/0.33 % DateTime : Sat Jul 9 23:40:53 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 7.64/2.31 # ENIGMATIC: Solved by autoschedule:
% 7.64/2.31 # No SInE strategy applied
% 7.64/2.31 # Trying AutoSched0 for 150 seconds
% 7.64/2.31 # AutoSched0-Mode selected heuristic G_E___092_C01_F1_AE_CS_SP_PS_CO_S0Y
% 7.64/2.31 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.64/2.31 #
% 7.64/2.31 # Preprocessing time : 0.013 s
% 7.64/2.31 # Presaturation interreduction done
% 7.64/2.31
% 7.64/2.31 # Proof found!
% 7.64/2.31 # SZS status Theorem
% 7.64/2.31 # SZS output start CNFRefutation
% See solution above
% 7.64/2.31 # Training examples: 0 positive, 0 negative
% 7.64/2.31
% 7.64/2.31 # -------------------------------------------------
% 7.64/2.31 # User time : 0.014 s
% 7.64/2.31 # System time : 0.003 s
% 7.64/2.31 # Total time : 0.017 s
% 7.64/2.31 # Maximum resident set size: 7120 pages
% 7.64/2.31
%------------------------------------------------------------------------------