TSTP Solution File: SEU129+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU129+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:38:39 EDT 2022
% Result : Theorem 7.05s 2.22s
% Output : CNFRefutation 7.05s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of clauses : 27 ( 10 unt; 2 nHn; 25 RR)
% Number of literals : 55 ( 6 equ; 28 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 : 49 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_11,plain,
( in(X1,X2)
| X3 != set_intersection2(X2,X4)
| ~ in(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-eodpuy01/input.p',i_0_11) ).
cnf(i_0_19,negated_conjecture,
~ subset(set_intersection2(esk5_0,esk7_0),set_intersection2(esk6_0,esk7_0)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-eodpuy01/input.p',i_0_19) ).
cnf(i_0_4,plain,
( subset(X1,X2)
| in(esk1_2(X1,X2),X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-eodpuy01/input.p',i_0_4) ).
cnf(i_0_10,plain,
( in(X1,X2)
| X3 != set_intersection2(X4,X2)
| ~ in(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-eodpuy01/input.p',i_0_10) ).
cnf(i_0_9,plain,
( in(X1,X2)
| X2 != set_intersection2(X3,X4)
| ~ in(X1,X4)
| ~ in(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-eodpuy01/input.p',i_0_9) ).
cnf(i_0_5,plain,
( in(X1,X2)
| ~ in(X1,X3)
| ~ subset(X3,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-eodpuy01/input.p',i_0_5) ).
cnf(i_0_20,negated_conjecture,
subset(esk5_0,esk6_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-eodpuy01/input.p',i_0_20) ).
cnf(i_0_3,plain,
( subset(X1,X2)
| ~ in(esk1_2(X1,X2),X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-eodpuy01/input.p',i_0_3) ).
cnf(c_0_29,plain,
( in(X1,X2)
| X3 != set_intersection2(X2,X4)
| ~ in(X1,X3) ),
i_0_11 ).
cnf(c_0_30,negated_conjecture,
~ subset(set_intersection2(esk5_0,esk7_0),set_intersection2(esk6_0,esk7_0)),
i_0_19 ).
cnf(c_0_31,plain,
( subset(X1,X2)
| in(esk1_2(X1,X2),X1) ),
i_0_4 ).
cnf(c_0_32,plain,
( in(X1,X2)
| X3 != set_intersection2(X4,X2)
| ~ in(X1,X3) ),
i_0_10 ).
cnf(c_0_33,plain,
( in(X1,X2)
| ~ in(X1,set_intersection2(X2,X3)) ),
inference(er,[status(thm)],[c_0_29]) ).
cnf(c_0_34,negated_conjecture,
in(esk1_2(set_intersection2(esk5_0,esk7_0),set_intersection2(esk6_0,esk7_0)),set_intersection2(esk5_0,esk7_0)),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_35,plain,
( in(X1,X2)
| X2 != set_intersection2(X3,X4)
| ~ in(X1,X4)
| ~ in(X1,X3) ),
i_0_9 ).
cnf(c_0_36,plain,
( in(X1,X2)
| ~ in(X1,set_intersection2(X3,X2)) ),
inference(er,[status(thm)],[c_0_32]) ).
cnf(c_0_37,plain,
( in(X1,X2)
| ~ in(X1,X3)
| ~ subset(X3,X2) ),
i_0_5 ).
cnf(c_0_38,plain,
in(esk1_2(set_intersection2(esk5_0,esk7_0),set_intersection2(esk6_0,esk7_0)),esk5_0),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_39,plain,
( in(X1,set_intersection2(X2,X3))
| ~ in(X1,X3)
| ~ in(X1,X2) ),
inference(er,[status(thm)],[c_0_35]) ).
cnf(c_0_40,plain,
in(esk1_2(set_intersection2(esk5_0,esk7_0),set_intersection2(esk6_0,esk7_0)),esk7_0),
inference(spm,[status(thm)],[c_0_36,c_0_34]) ).
cnf(c_0_41,plain,
( in(esk1_2(set_intersection2(esk5_0,esk7_0),set_intersection2(esk6_0,esk7_0)),X1)
| ~ subset(esk5_0,X1) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_42,negated_conjecture,
subset(esk5_0,esk6_0),
i_0_20 ).
cnf(c_0_43,plain,
( in(esk1_2(set_intersection2(esk5_0,esk7_0),set_intersection2(esk6_0,esk7_0)),set_intersection2(X1,esk7_0))
| ~ in(esk1_2(set_intersection2(esk5_0,esk7_0),set_intersection2(esk6_0,esk7_0)),X1) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_44,negated_conjecture,
in(esk1_2(set_intersection2(esk5_0,esk7_0),set_intersection2(esk6_0,esk7_0)),esk6_0),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_45,plain,
( subset(X1,X2)
| ~ in(esk1_2(X1,X2),X2) ),
i_0_3 ).
cnf(c_0_46,negated_conjecture,
in(esk1_2(set_intersection2(esk5_0,esk7_0),set_intersection2(esk6_0,esk7_0)),set_intersection2(esk6_0,esk7_0)),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_47,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_30]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU129+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n006.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sun Jun 19 12:29:12 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected complete mode:
% 7.05/2.22 # ENIGMATIC: Solved by autoschedule:
% 7.05/2.22 # No SInE strategy applied
% 7.05/2.22 # Trying AutoSched0 for 150 seconds
% 7.05/2.22 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S03EI
% 7.05/2.22 # and selection function SelectLComplex.
% 7.05/2.22 #
% 7.05/2.22 # Preprocessing time : 0.013 s
% 7.05/2.22 # Presaturation interreduction done
% 7.05/2.22
% 7.05/2.22 # Proof found!
% 7.05/2.22 # SZS status Theorem
% 7.05/2.22 # SZS output start CNFRefutation
% See solution above
% 7.05/2.22 # Training examples: 0 positive, 0 negative
% 7.05/2.22
% 7.05/2.22 # -------------------------------------------------
% 7.05/2.22 # User time : 0.015 s
% 7.05/2.22 # System time : 0.008 s
% 7.05/2.22 # Total time : 0.023 s
% 7.05/2.22 # Maximum resident set size: 7124 pages
% 7.05/2.22
%------------------------------------------------------------------------------