TSTP Solution File: SET627+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SET627+3 : TPTP v8.1.0. Released v2.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:12:58 EDT 2022
% Result : Theorem 7.54s 2.46s
% Output : CNFRefutation 7.54s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 4
% Syntax : Number of clauses : 11 ( 7 unt; 2 nHn; 9 RR)
% Number of literals : 15 ( 0 equ; 7 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 11 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_10,negated_conjecture,
~ disjoint(esk3_0,empty_set),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2od57mf7/input.p',i_0_10) ).
cnf(i_0_5,plain,
( intersect(X1,X2)
| disjoint(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2od57mf7/input.p',i_0_5) ).
cnf(i_0_1,plain,
~ member(X1,empty_set),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2od57mf7/input.p',i_0_1) ).
cnf(i_0_3,plain,
( member(esk1_2(X1,X2),X2)
| ~ intersect(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2od57mf7/input.p',i_0_3) ).
cnf(c_0_15,negated_conjecture,
~ disjoint(esk3_0,empty_set),
i_0_10 ).
cnf(c_0_16,plain,
( intersect(X1,X2)
| disjoint(X1,X2) ),
i_0_5 ).
cnf(c_0_17,plain,
~ member(X1,empty_set),
i_0_1 ).
cnf(c_0_18,plain,
( member(esk1_2(X1,X2),X2)
| ~ intersect(X1,X2) ),
i_0_3 ).
cnf(c_0_19,negated_conjecture,
intersect(esk3_0,empty_set),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,plain,
~ intersect(X1,empty_set),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_19,c_0_20]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SET627+3 : TPTP v8.1.0. Released v2.2.0.
% 0.06/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n005.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sun Jul 10 14:45:08 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected complete mode:
% 7.54/2.46 # ENIGMATIC: Solved by autoschedule:
% 7.54/2.46 # No SInE strategy applied
% 7.54/2.46 # Trying AutoSched0 for 150 seconds
% 7.54/2.46 # AutoSched0-Mode selected heuristic G_E___092_C01_F1_AE_CS_SP_PS_CO_S0Y
% 7.54/2.46 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.54/2.46 #
% 7.54/2.46 # Preprocessing time : 0.023 s
% 7.54/2.46 # Presaturation interreduction done
% 7.54/2.46
% 7.54/2.46 # Proof found!
% 7.54/2.46 # SZS status Theorem
% 7.54/2.46 # SZS output start CNFRefutation
% See solution above
% 7.54/2.46 # Training examples: 0 positive, 0 negative
% 7.54/2.46
% 7.54/2.46 # -------------------------------------------------
% 7.54/2.46 # User time : 0.023 s
% 7.54/2.46 # System time : 0.006 s
% 7.54/2.46 # Total time : 0.029 s
% 7.54/2.46 # Maximum resident set size: 7124 pages
% 7.54/2.46
%------------------------------------------------------------------------------