TSTP Solution File: SEU133+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU133+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n017.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 08:38:42 EDT 2022
% Result : Theorem 7.37s 2.30s
% Output : CNFRefutation 7.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of clauses : 12 ( 4 unt; 3 nHn; 8 RR)
% Number of literals : 22 ( 2 equ; 9 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 24 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_10,plain,
( in(X1,X2)
| X3 != set_difference(X2,X4)
| ~ in(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-o4h94u3z/input.p',i_0_10) ).
cnf(i_0_3,plain,
( subset(X1,X2)
| in(esk1_2(X1,X2),X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-o4h94u3z/input.p',i_0_3) ).
cnf(i_0_2,plain,
( subset(X1,X2)
| ~ in(esk1_2(X1,X2),X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-o4h94u3z/input.p',i_0_2) ).
cnf(i_0_17,negated_conjecture,
~ subset(set_difference(esk5_0,esk6_0),esk5_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-o4h94u3z/input.p',i_0_17) ).
cnf(c_0_22,plain,
( in(X1,X2)
| X3 != set_difference(X2,X4)
| ~ in(X1,X3) ),
i_0_10 ).
cnf(c_0_23,plain,
( in(X1,X2)
| ~ in(X1,set_difference(X2,X3)) ),
inference(er,[status(thm)],[c_0_22]) ).
cnf(c_0_24,plain,
( subset(X1,X2)
| in(esk1_2(X1,X2),X1) ),
i_0_3 ).
cnf(c_0_25,plain,
( subset(X1,X2)
| ~ in(esk1_2(X1,X2),X2) ),
i_0_2 ).
cnf(c_0_26,plain,
( in(esk1_2(set_difference(X1,X2),X3),X1)
| subset(set_difference(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_27,negated_conjecture,
~ subset(set_difference(esk5_0,esk6_0),esk5_0),
i_0_17 ).
cnf(c_0_28,plain,
subset(set_difference(X1,X2),X1),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_29,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_28])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.12 % Problem : SEU133+1 : TPTP v8.1.0. Released v3.3.0.
% 0.09/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n017.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 : Sun Jun 19 11:53:45 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 7.37/2.30 # ENIGMATIC: Solved by autoschedule:
% 7.37/2.30 # No SInE strategy applied
% 7.37/2.30 # Trying AutoSched0 for 150 seconds
% 7.37/2.30 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S0Y_ni
% 7.37/2.30 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.37/2.30 #
% 7.37/2.30 # Preprocessing time : 0.013 s
% 7.37/2.30 # Presaturation interreduction done
% 7.37/2.30
% 7.37/2.30 # Proof found!
% 7.37/2.30 # SZS status Theorem
% 7.37/2.30 # SZS output start CNFRefutation
% See solution above
% 7.37/2.30 # Training examples: 0 positive, 0 negative
% 7.37/2.30
% 7.37/2.30 # -------------------------------------------------
% 7.37/2.30 # User time : 0.016 s
% 7.37/2.30 # System time : 0.003 s
% 7.37/2.30 # Total time : 0.019 s
% 7.37/2.30 # Maximum resident set size: 7120 pages
% 7.37/2.30
%------------------------------------------------------------------------------