TSTP Solution File: SEU125+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU125+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n013.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:37 EDT 2022
% Result : Theorem 8.36s 2.47s
% Output : CNFRefutation 8.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of clauses : 22 ( 9 unt; 9 nHn; 20 RR)
% Number of literals : 44 ( 2 equ; 15 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 27 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_8,plain,
( in(X1,X2)
| in(X1,X3)
| X4 != set_union2(X3,X2)
| ~ in(X1,X4) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-t5qpxsxy/lgb.p',i_0_8) ).
cnf(i_0_25,negated_conjecture,
~ subset(set_union2(esk5_0,esk7_0),esk6_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-t5qpxsxy/lgb.p',i_0_25) ).
cnf(i_0_10,plain,
( subset(X1,X2)
| in(esk2_2(X1,X2),X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-t5qpxsxy/lgb.p',i_0_10) ).
cnf(i_0_11,plain,
( in(X1,X2)
| ~ in(X1,X3)
| ~ subset(X3,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-t5qpxsxy/lgb.p',i_0_11) ).
cnf(i_0_26,negated_conjecture,
subset(esk7_0,esk6_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-t5qpxsxy/lgb.p',i_0_26) ).
cnf(i_0_27,negated_conjecture,
subset(esk5_0,esk6_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-t5qpxsxy/lgb.p',i_0_27) ).
cnf(i_0_9,plain,
( subset(X1,X2)
| ~ in(esk2_2(X1,X2),X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-t5qpxsxy/lgb.p',i_0_9) ).
cnf(c_0_35,plain,
( in(X1,X2)
| in(X1,X3)
| X4 != set_union2(X3,X2)
| ~ in(X1,X4) ),
i_0_8 ).
cnf(c_0_36,negated_conjecture,
~ subset(set_union2(esk5_0,esk7_0),esk6_0),
i_0_25 ).
cnf(c_0_37,plain,
( subset(X1,X2)
| in(esk2_2(X1,X2),X1) ),
i_0_10 ).
cnf(c_0_38,plain,
( in(X1,X2)
| in(X1,X3)
| ~ in(X1,set_union2(X2,X3)) ),
inference(er,[status(thm)],[c_0_35]) ).
cnf(c_0_39,negated_conjecture,
in(esk2_2(set_union2(esk5_0,esk7_0),esk6_0),set_union2(esk5_0,esk7_0)),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_40,plain,
( in(X1,X2)
| ~ in(X1,X3)
| ~ subset(X3,X2) ),
i_0_11 ).
cnf(c_0_41,plain,
( in(esk2_2(set_union2(esk5_0,esk7_0),esk6_0),esk5_0)
| in(esk2_2(set_union2(esk5_0,esk7_0),esk6_0),esk7_0) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_42,plain,
( in(esk2_2(set_union2(esk5_0,esk7_0),esk6_0),esk5_0)
| in(esk2_2(set_union2(esk5_0,esk7_0),esk6_0),X1)
| ~ subset(esk7_0,X1) ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_43,negated_conjecture,
subset(esk7_0,esk6_0),
i_0_26 ).
cnf(c_0_44,negated_conjecture,
( in(esk2_2(set_union2(esk5_0,esk7_0),esk6_0),esk6_0)
| in(esk2_2(set_union2(esk5_0,esk7_0),esk6_0),esk5_0) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_45,plain,
( in(esk2_2(set_union2(esk5_0,esk7_0),esk6_0),esk6_0)
| in(esk2_2(set_union2(esk5_0,esk7_0),esk6_0),X1)
| ~ subset(esk5_0,X1) ),
inference(spm,[status(thm)],[c_0_40,c_0_44]) ).
cnf(c_0_46,negated_conjecture,
subset(esk5_0,esk6_0),
i_0_27 ).
cnf(c_0_47,plain,
( subset(X1,X2)
| ~ in(esk2_2(X1,X2),X2) ),
i_0_9 ).
cnf(c_0_48,negated_conjecture,
in(esk2_2(set_union2(esk5_0,esk7_0),esk6_0),esk6_0),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_49,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_36]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SEU125+1 : TPTP v8.1.0. Released v3.3.0.
% 0.11/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n013.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.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Sun Jun 19 19:19:01 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.19/0.46 # ENIGMATIC: Selected complete mode:
% 8.36/2.47 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.36/2.47 # No SInE strategy applied
% 8.36/2.47 # Trying AutoSched0 for 150 seconds
% 8.36/2.47 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S03EI
% 8.36/2.47 # and selection function SelectLComplex.
% 8.36/2.47 #
% 8.36/2.47 # Preprocessing time : 0.023 s
% 8.36/2.47 # Presaturation interreduction done
% 8.36/2.47
% 8.36/2.47 # Proof found!
% 8.36/2.47 # SZS status Theorem
% 8.36/2.47 # SZS output start CNFRefutation
% See solution above
% 8.36/2.47 # Training examples: 0 positive, 0 negative
% 8.36/2.47
% 8.36/2.47 # -------------------------------------------------
% 8.36/2.47 # User time : 0.026 s
% 8.36/2.47 # System time : 0.006 s
% 8.36/2.47 # Total time : 0.032 s
% 8.36/2.47 # Maximum resident set size: 7120 pages
% 8.36/2.47
%------------------------------------------------------------------------------