TSTP Solution File: SEU132+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU132+1 : TPTP v8.1.0. Released v3.3.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 08:38:41 EDT 2022
% Result : Theorem 7.66s 2.38s
% Output : CNFRefutation 7.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 8
% Syntax : Number of clauses : 30 ( 7 unt; 9 nHn; 22 RR)
% Number of literals : 65 ( 6 equ; 31 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 : 66 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_4,plain,
( in(X1,X2)
| ~ in(X1,X3)
| ~ subset(X3,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-e2n0vdc9/lgb.p',i_0_4) ).
cnf(i_0_18,negated_conjecture,
subset(esk5_0,esk6_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-e2n0vdc9/lgb.p',i_0_18) ).
cnf(i_0_10,plain,
( in(X1,X2)
| X3 != set_difference(X2,X4)
| ~ in(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-e2n0vdc9/lgb.p',i_0_10) ).
cnf(i_0_2,plain,
( subset(X1,X2)
| ~ in(esk1_2(X1,X2),X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-e2n0vdc9/lgb.p',i_0_2) ).
cnf(i_0_3,plain,
( subset(X1,X2)
| in(esk1_2(X1,X2),X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-e2n0vdc9/lgb.p',i_0_3) ).
cnf(i_0_8,plain,
( in(X1,X2)
| in(X1,X3)
| X2 != set_difference(X4,X3)
| ~ in(X1,X4) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-e2n0vdc9/lgb.p',i_0_8) ).
cnf(i_0_9,plain,
( X1 != set_difference(X2,X3)
| ~ in(X4,X1)
| ~ in(X4,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-e2n0vdc9/lgb.p',i_0_9) ).
cnf(i_0_17,negated_conjecture,
~ subset(set_difference(esk5_0,esk7_0),set_difference(esk6_0,esk7_0)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-e2n0vdc9/lgb.p',i_0_17) ).
cnf(c_0_27,plain,
( in(X1,X2)
| ~ in(X1,X3)
| ~ subset(X3,X2) ),
i_0_4 ).
cnf(c_0_28,negated_conjecture,
subset(esk5_0,esk6_0),
i_0_18 ).
cnf(c_0_29,plain,
( in(X1,X2)
| X3 != set_difference(X2,X4)
| ~ in(X1,X3) ),
i_0_10 ).
cnf(c_0_30,plain,
( subset(X1,X2)
| ~ in(esk1_2(X1,X2),X2) ),
i_0_2 ).
cnf(c_0_31,negated_conjecture,
( in(X1,esk6_0)
| ~ in(X1,esk5_0) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_32,plain,
( in(X1,X2)
| ~ in(X1,set_difference(X2,X3)) ),
inference(er,[status(thm)],[c_0_29]) ).
cnf(c_0_33,plain,
( subset(X1,X2)
| in(esk1_2(X1,X2),X1) ),
i_0_3 ).
cnf(c_0_34,plain,
( subset(X1,esk6_0)
| ~ in(esk1_2(X1,esk6_0),esk5_0) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_35,plain,
( in(esk1_2(set_difference(X1,X2),X3),X1)
| subset(set_difference(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_36,plain,
( in(X1,X2)
| in(X1,X3)
| X2 != set_difference(X4,X3)
| ~ in(X1,X4) ),
i_0_8 ).
cnf(c_0_37,plain,
subset(set_difference(esk5_0,X1),esk6_0),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_38,plain,
( X1 != set_difference(X2,X3)
| ~ in(X4,X1)
| ~ in(X4,X3) ),
i_0_9 ).
cnf(c_0_39,plain,
( in(X1,set_difference(X2,X3))
| in(X1,X3)
| ~ in(X1,X2) ),
inference(er,[status(thm)],[c_0_36]) ).
cnf(c_0_40,plain,
( in(X1,esk6_0)
| ~ in(X1,set_difference(esk5_0,X2)) ),
inference(spm,[status(thm)],[c_0_27,c_0_37]) ).
cnf(c_0_41,plain,
( ~ in(X1,set_difference(X2,X3))
| ~ in(X1,X3) ),
inference(er,[status(thm)],[c_0_38]) ).
cnf(c_0_42,plain,
( in(esk1_2(X1,set_difference(X2,X3)),X3)
| subset(X1,set_difference(X2,X3))
| ~ in(esk1_2(X1,set_difference(X2,X3)),X2) ),
inference(spm,[status(thm)],[c_0_30,c_0_39]) ).
cnf(c_0_43,plain,
( in(esk1_2(set_difference(esk5_0,X1),X2),esk6_0)
| subset(set_difference(esk5_0,X1),X2) ),
inference(spm,[status(thm)],[c_0_40,c_0_33]) ).
cnf(c_0_44,plain,
( subset(set_difference(X1,X2),X3)
| ~ in(esk1_2(set_difference(X1,X2),X3),X2) ),
inference(spm,[status(thm)],[c_0_41,c_0_33]) ).
cnf(c_0_45,plain,
( in(esk1_2(set_difference(esk5_0,X1),set_difference(esk6_0,X2)),X2)
| subset(set_difference(esk5_0,X1),set_difference(esk6_0,X2)) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_46,negated_conjecture,
~ subset(set_difference(esk5_0,esk7_0),set_difference(esk6_0,esk7_0)),
i_0_17 ).
cnf(c_0_47,plain,
subset(set_difference(esk5_0,X1),set_difference(esk6_0,X1)),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_48,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_46,c_0_47])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU132+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n029.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 23:04:01 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 7.66/2.38 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.66/2.38 # No SInE strategy applied
% 7.66/2.38 # Trying AutoSched0 for 150 seconds
% 7.66/2.38 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S0Y_ni
% 7.66/2.38 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.66/2.38 #
% 7.66/2.38 # Preprocessing time : 0.024 s
% 7.66/2.38 # Presaturation interreduction done
% 7.66/2.38
% 7.66/2.38 # Proof found!
% 7.66/2.38 # SZS status Theorem
% 7.66/2.38 # SZS output start CNFRefutation
% See solution above
% 7.66/2.38 # Training examples: 0 positive, 0 negative
% 7.66/2.38
% 7.66/2.38 # -------------------------------------------------
% 7.66/2.38 # User time : 0.052 s
% 7.66/2.38 # System time : 0.007 s
% 7.66/2.38 # Total time : 0.059 s
% 7.66/2.38 # Maximum resident set size: 7128 pages
% 7.66/2.38
%------------------------------------------------------------------------------