TSTP Solution File: SET875+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SET875+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n029.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:14:57 EDT 2022
% Result : Theorem 7.84s 2.42s
% Output : CNFRefutation 7.84s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 4
% Syntax : Number of clauses : 11 ( 7 unt; 0 nHn; 10 RR)
% Number of literals : 17 ( 6 equ; 8 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-1 aty)
% Number of variables : 11 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_11,negated_conjecture,
disjoint(singleton(esk4_0),singleton(esk5_0)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ak3j9eks/lgb.p',i_0_11) ).
cnf(i_0_10,negated_conjecture,
esk5_0 = esk4_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ak3j9eks/lgb.p',i_0_10) ).
cnf(i_0_4,plain,
( in(X1,X2)
| X1 != X3
| X2 != singleton(X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ak3j9eks/lgb.p',i_0_4) ).
cnf(i_0_6,plain,
( ~ in(X1,X2)
| ~ disjoint(singleton(X1),X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ak3j9eks/lgb.p',i_0_6) ).
cnf(c_0_16,negated_conjecture,
disjoint(singleton(esk4_0),singleton(esk5_0)),
i_0_11 ).
cnf(c_0_17,negated_conjecture,
esk5_0 = esk4_0,
i_0_10 ).
cnf(c_0_18,plain,
( in(X1,X2)
| X1 != X3
| X2 != singleton(X3) ),
i_0_4 ).
cnf(c_0_19,plain,
( ~ in(X1,X2)
| ~ disjoint(singleton(X1),X2) ),
i_0_6 ).
cnf(c_0_20,negated_conjecture,
disjoint(singleton(esk4_0),singleton(esk4_0)),
inference(rw,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,plain,
in(X1,singleton(X1)),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_18])]) ).
cnf(c_0_22,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET875+1 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n029.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 : Mon Jul 11 00:46:48 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected complete mode:
% 7.84/2.42 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.84/2.42 # No SInE strategy applied
% 7.84/2.42 # Trying AutoSched0 for 150 seconds
% 7.84/2.42 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S029N
% 7.84/2.42 # and selection function PSelectNonRROptimalLit.
% 7.84/2.42 #
% 7.84/2.42 # Preprocessing time : 0.013 s
% 7.84/2.42 # Presaturation interreduction done
% 7.84/2.42
% 7.84/2.42 # Proof found!
% 7.84/2.42 # SZS status Theorem
% 7.84/2.42 # SZS output start CNFRefutation
% See solution above
% 7.84/2.42 # Training examples: 0 positive, 0 negative
% 7.84/2.42
% 7.84/2.42 # -------------------------------------------------
% 7.84/2.42 # User time : 0.014 s
% 7.84/2.42 # System time : 0.004 s
% 7.84/2.42 # Total time : 0.017 s
% 7.84/2.42 # Maximum resident set size: 7128 pages
% 7.84/2.42
%------------------------------------------------------------------------------