TSTP Solution File: SEU133+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU133+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n003.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 8.28s 2.59s
% Output : CNFRefutation 8.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of clauses : 12 ( 5 unt; 2 nHn; 10 RR)
% Number of literals : 21 ( 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 : 19 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_29,plain,
( in(X1,X2)
| X3 != set_difference(X2,X4)
| ~ in(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9i7s4bhd/lgb.p',i_0_29) ).
cnf(i_0_59,negated_conjecture,
~ subset(set_difference(esk9_0,esk10_0),esk9_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9i7s4bhd/lgb.p',i_0_59) ).
cnf(i_0_16,plain,
( subset(X1,X2)
| in(esk3_2(X1,X2),X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9i7s4bhd/lgb.p',i_0_16) ).
cnf(i_0_15,plain,
( subset(X1,X2)
| ~ in(esk3_2(X1,X2),X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9i7s4bhd/lgb.p',i_0_15) ).
cnf(c_0_64,plain,
( in(X1,X2)
| X3 != set_difference(X2,X4)
| ~ in(X1,X3) ),
i_0_29 ).
cnf(c_0_65,negated_conjecture,
~ subset(set_difference(esk9_0,esk10_0),esk9_0),
i_0_59 ).
cnf(c_0_66,plain,
( subset(X1,X2)
| in(esk3_2(X1,X2),X1) ),
i_0_16 ).
cnf(c_0_67,plain,
( in(X1,X2)
| ~ in(X1,set_difference(X2,X3)) ),
inference(er,[status(thm)],[c_0_64]) ).
cnf(c_0_68,negated_conjecture,
in(esk3_2(set_difference(esk9_0,esk10_0),esk9_0),set_difference(esk9_0,esk10_0)),
inference(spm,[status(thm)],[c_0_65,c_0_66]) ).
cnf(c_0_69,plain,
( subset(X1,X2)
| ~ in(esk3_2(X1,X2),X2) ),
i_0_15 ).
cnf(c_0_70,plain,
in(esk3_2(set_difference(esk9_0,esk10_0),esk9_0),esk9_0),
inference(spm,[status(thm)],[c_0_67,c_0_68]) ).
cnf(c_0_71,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_70]),c_0_65]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.13 % Problem : SEU133+2 : TPTP v8.1.0. Released v3.3.0.
% 0.10/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n003.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 : Sun Jun 19 22:30:01 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.46 # ENIGMATIC: Selected complete mode:
% 8.28/2.59 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.28/2.59 # No SInE strategy applied
% 8.28/2.59 # Trying AutoSched0 for 150 seconds
% 8.28/2.59 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S006A
% 8.28/2.59 # and selection function SelectLargestNegLit.
% 8.28/2.59 #
% 8.28/2.59 # Preprocessing time : 0.021 s
% 8.28/2.59 # Presaturation interreduction done
% 8.28/2.59
% 8.28/2.59 # Proof found!
% 8.28/2.59 # SZS status Theorem
% 8.28/2.59 # SZS output start CNFRefutation
% See solution above
% 8.28/2.59 # Training examples: 0 positive, 0 negative
% 8.28/2.59
% 8.28/2.59 # -------------------------------------------------
% 8.28/2.59 # User time : 0.027 s
% 8.28/2.59 # System time : 0.004 s
% 8.28/2.59 # Total time : 0.030 s
% 8.28/2.59 # Maximum resident set size: 7124 pages
% 8.28/2.59
%------------------------------------------------------------------------------