TSTP Solution File: SEU130+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU130+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n026.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:40 EDT 2022
% Result : Theorem 6.77s 2.28s
% Output : CNFRefutation 6.77s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 9
% Syntax : Number of clauses : 27 ( 10 unt; 7 nHn; 17 RR)
% Number of literals : 55 ( 14 equ; 23 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 : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 49 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_3,plain,
( X1 = X2
| ~ subset(X2,X1)
| ~ subset(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lkcgmn69/lgb.p',i_0_3) ).
cnf(i_0_22,plain,
subset(set_intersection2(X1,X2),X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lkcgmn69/lgb.p',i_0_22) ).
cnf(i_0_7,plain,
( subset(X1,X2)
| in(esk1_2(X1,X2),X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lkcgmn69/lgb.p',i_0_7) ).
cnf(i_0_12,plain,
( in(X1,X2)
| X2 != set_intersection2(X3,X4)
| ~ in(X1,X4)
| ~ in(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lkcgmn69/lgb.p',i_0_12) ).
cnf(i_0_8,plain,
( in(X1,X2)
| ~ in(X1,X3)
| ~ subset(X3,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lkcgmn69/lgb.p',i_0_8) ).
cnf(i_0_24,negated_conjecture,
subset(esk5_0,esk6_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lkcgmn69/lgb.p',i_0_24) ).
cnf(i_0_2,plain,
set_intersection2(X1,X2) = set_intersection2(X2,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lkcgmn69/lgb.p',i_0_2) ).
cnf(i_0_6,plain,
( subset(X1,X2)
| ~ in(esk1_2(X1,X2),X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lkcgmn69/lgb.p',i_0_6) ).
cnf(i_0_23,negated_conjecture,
set_intersection2(esk5_0,esk6_0) != esk5_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lkcgmn69/lgb.p',i_0_23) ).
cnf(c_0_34,plain,
( X1 = X2
| ~ subset(X2,X1)
| ~ subset(X1,X2) ),
i_0_3 ).
cnf(c_0_35,plain,
subset(set_intersection2(X1,X2),X1),
i_0_22 ).
cnf(c_0_36,plain,
( set_intersection2(X1,X2) = X1
| ~ subset(X1,set_intersection2(X1,X2)) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_37,plain,
( subset(X1,X2)
| in(esk1_2(X1,X2),X1) ),
i_0_7 ).
cnf(c_0_38,plain,
( in(X1,X2)
| X2 != set_intersection2(X3,X4)
| ~ in(X1,X4)
| ~ in(X1,X3) ),
i_0_12 ).
cnf(c_0_39,plain,
( in(X1,X2)
| ~ in(X1,X3)
| ~ subset(X3,X2) ),
i_0_8 ).
cnf(c_0_40,plain,
( set_intersection2(X1,X2) = X1
| in(esk1_2(X1,set_intersection2(X1,X2)),X1) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_41,plain,
( in(X1,set_intersection2(X2,X3))
| ~ in(X1,X3)
| ~ in(X1,X2) ),
inference(er,[status(thm)],[c_0_38]) ).
cnf(c_0_42,plain,
( set_intersection2(X1,X2) = X1
| in(esk1_2(X1,set_intersection2(X1,X2)),X3)
| ~ subset(X1,X3) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_43,negated_conjecture,
subset(esk5_0,esk6_0),
i_0_24 ).
cnf(c_0_44,plain,
( set_intersection2(X1,X2) = X1
| in(esk1_2(X1,set_intersection2(X1,X2)),set_intersection2(X3,X1))
| ~ in(esk1_2(X1,set_intersection2(X1,X2)),X3) ),
inference(spm,[status(thm)],[c_0_41,c_0_40]) ).
cnf(c_0_45,negated_conjecture,
( set_intersection2(esk5_0,X1) = esk5_0
| in(esk1_2(esk5_0,set_intersection2(esk5_0,X1)),esk6_0) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_46,plain,
set_intersection2(X1,X2) = set_intersection2(X2,X1),
i_0_2 ).
cnf(c_0_47,plain,
( subset(X1,X2)
| ~ in(esk1_2(X1,X2),X2) ),
i_0_6 ).
cnf(c_0_48,negated_conjecture,
( set_intersection2(esk5_0,X1) = esk5_0
| in(esk1_2(esk5_0,set_intersection2(esk5_0,X1)),set_intersection2(esk5_0,esk6_0)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_46]) ).
cnf(c_0_49,negated_conjecture,
set_intersection2(esk5_0,esk6_0) != esk5_0,
i_0_23 ).
cnf(c_0_50,plain,
subset(esk5_0,set_intersection2(esk5_0,esk6_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_49]) ).
cnf(c_0_51,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_50]),c_0_35])]),c_0_49]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU130+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n026.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 : Mon Jun 20 03:44:12 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.45 # ENIGMATIC: Selected complete mode:
% 6.77/2.28 # ENIGMATIC: Solved by autoschedule-lgb:
% 6.77/2.28 # No SInE strategy applied
% 6.77/2.28 # Trying AutoSched0 for 150 seconds
% 6.77/2.28 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S03EI
% 6.77/2.28 # and selection function SelectLComplex.
% 6.77/2.28 #
% 6.77/2.28 # Preprocessing time : 0.012 s
% 6.77/2.28 # Presaturation interreduction done
% 6.77/2.28
% 6.77/2.28 # Proof found!
% 6.77/2.28 # SZS status Theorem
% 6.77/2.28 # SZS output start CNFRefutation
% See solution above
% 6.77/2.28 # Training examples: 0 positive, 0 negative
% 6.77/2.28
% 6.77/2.28 # -------------------------------------------------
% 6.77/2.28 # User time : 0.034 s
% 6.77/2.28 # System time : 0.007 s
% 6.77/2.28 # Total time : 0.041 s
% 6.77/2.28 # Maximum resident set size: 7124 pages
% 6.77/2.28
%------------------------------------------------------------------------------