TSTP Solution File: SEU230+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU230+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n006.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:39:50 EDT 2022
% Result : Theorem 8.47s 2.42s
% Output : CNFRefutation 8.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of clauses : 14 ( 8 unt; 0 nHn; 9 RR)
% Number of literals : 24 ( 10 equ; 12 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-2 aty)
% Number of variables : 28 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_11,plain,
( in(X1,X2)
| X1 != X3
| X2 != singleton(X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-04yh4bse/lgb.p',i_0_11) ).
cnf(i_0_17,plain,
( in(X1,X2)
| X2 != set_union2(X3,X4)
| ~ in(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-04yh4bse/lgb.p',i_0_17) ).
cnf(i_0_7,plain,
set_union2(X1,X2) = set_union2(X2,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-04yh4bse/lgb.p',i_0_7) ).
cnf(i_0_55,negated_conjecture,
~ in(esk13_0,set_union2(esk13_0,singleton(esk13_0))),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-04yh4bse/lgb.p',i_0_55) ).
cnf(c_0_60,plain,
( in(X1,X2)
| X1 != X3
| X2 != singleton(X3) ),
i_0_11 ).
cnf(c_0_61,plain,
( in(X1,X2)
| X2 != singleton(X1) ),
inference(er,[status(thm)],[c_0_60]) ).
cnf(c_0_62,plain,
( in(X1,X2)
| X2 != set_union2(X3,X4)
| ~ in(X1,X3) ),
i_0_17 ).
cnf(c_0_63,plain,
in(X1,singleton(X1)),
inference(er,[status(thm)],[c_0_61]) ).
cnf(c_0_64,plain,
( in(X1,X2)
| X2 != set_union2(singleton(X1),X3) ),
inference(spm,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_65,plain,
in(X1,set_union2(singleton(X1),X2)),
inference(er,[status(thm)],[c_0_64]) ).
cnf(c_0_66,plain,
set_union2(X1,X2) = set_union2(X2,X1),
i_0_7 ).
cnf(c_0_67,negated_conjecture,
~ in(esk13_0,set_union2(esk13_0,singleton(esk13_0))),
i_0_55 ).
cnf(c_0_68,plain,
in(X1,set_union2(X2,singleton(X1))),
inference(spm,[status(thm)],[c_0_65,c_0_66]) ).
cnf(c_0_69,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_67,c_0_68])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU230+1 : TPTP v8.1.0. Released v3.3.0.
% 0.12/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n006.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 : Sat Jun 18 20:00:42 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected complete mode:
% 8.47/2.42 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.47/2.42 # No SInE strategy applied
% 8.47/2.42 # Trying AutoSched0 for 150 seconds
% 8.47/2.42 # AutoSched0-Mode selected heuristic G_E___008_C45_F1_PI_AE_Q4_CS_SP_S4d
% 8.47/2.42 # and selection function SelectCQIPrecWNTNp.
% 8.47/2.42 #
% 8.47/2.42 # Preprocessing time : 0.023 s
% 8.47/2.42
% 8.47/2.42 # Proof found!
% 8.47/2.42 # SZS status Theorem
% 8.47/2.42 # SZS output start CNFRefutation
% See solution above
% 8.47/2.42 # Training examples: 0 positive, 0 negative
% 8.47/2.42
% 8.47/2.42 # -------------------------------------------------
% 8.47/2.42 # User time : 0.021 s
% 8.47/2.42 # System time : 0.010 s
% 8.47/2.42 # Total time : 0.031 s
% 8.47/2.42 # Maximum resident set size: 7124 pages
% 8.47/2.42
%------------------------------------------------------------------------------