TSTP Solution File: SEU154+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU154+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n022.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:56 EDT 2022
% Result : Theorem 7.67s 2.48s
% Output : CNFRefutation 7.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 10
% Syntax : Number of clauses : 31 ( 13 unt; 4 nHn; 23 RR)
% Number of literals : 57 ( 18 equ; 26 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 52 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_3,plain,
( X1 = X2
| ~ subset(X2,X1)
| ~ subset(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3wlw69nx/lgb.p',i_0_3) ).
cnf(i_0_32,plain,
subset(empty_set,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3wlw69nx/lgb.p',i_0_32) ).
cnf(i_0_11,plain,
( subset(X1,X2)
| in(esk2_2(X1,X2),X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3wlw69nx/lgb.p',i_0_11) ).
cnf(i_0_19,plain,
( disjoint(X1,X2)
| set_intersection2(X1,X2) != empty_set ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3wlw69nx/lgb.p',i_0_19) ).
cnf(i_0_17,plain,
( in(X1,X2)
| X3 != set_intersection2(X4,X2)
| ~ in(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3wlw69nx/lgb.p',i_0_17) ).
cnf(i_0_26,negated_conjecture,
~ disjoint(singleton(esk4_0),esk5_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3wlw69nx/lgb.p',i_0_26) ).
cnf(i_0_2,plain,
set_intersection2(X1,X2) = set_intersection2(X2,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3wlw69nx/lgb.p',i_0_2) ).
cnf(i_0_18,plain,
( in(X1,X2)
| X3 != set_intersection2(X2,X4)
| ~ in(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3wlw69nx/lgb.p',i_0_18) ).
cnf(i_0_9,plain,
( X1 = X2
| X3 != singleton(X2)
| ~ in(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3wlw69nx/lgb.p',i_0_9) ).
cnf(i_0_27,negated_conjecture,
~ in(esk4_0,esk5_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3wlw69nx/lgb.p',i_0_27) ).
cnf(c_0_43,plain,
( X1 = X2
| ~ subset(X2,X1)
| ~ subset(X1,X2) ),
i_0_3 ).
cnf(c_0_44,plain,
subset(empty_set,X1),
i_0_32 ).
cnf(c_0_45,plain,
( X1 = empty_set
| ~ subset(X1,empty_set) ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_46,plain,
( subset(X1,X2)
| in(esk2_2(X1,X2),X1) ),
i_0_11 ).
cnf(c_0_47,plain,
( disjoint(X1,X2)
| set_intersection2(X1,X2) != empty_set ),
i_0_19 ).
cnf(c_0_48,plain,
( X1 = empty_set
| in(esk2_2(X1,empty_set),X1) ),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_49,plain,
( in(X1,X2)
| X3 != set_intersection2(X4,X2)
| ~ in(X1,X3) ),
i_0_17 ).
cnf(c_0_50,negated_conjecture,
~ disjoint(singleton(esk4_0),esk5_0),
i_0_26 ).
cnf(c_0_51,plain,
( in(esk2_2(set_intersection2(X1,X2),empty_set),set_intersection2(X1,X2))
| disjoint(X1,X2) ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_52,plain,
set_intersection2(X1,X2) = set_intersection2(X2,X1),
i_0_2 ).
cnf(c_0_53,plain,
( in(X1,X2)
| X3 != set_intersection2(X2,X4)
| ~ in(X1,X3) ),
i_0_18 ).
cnf(c_0_54,plain,
( X1 = X2
| X3 != singleton(X2)
| ~ in(X1,X3) ),
i_0_9 ).
cnf(c_0_55,plain,
( in(X1,X2)
| ~ in(X1,set_intersection2(X3,X2)) ),
inference(er,[status(thm)],[c_0_49]) ).
cnf(c_0_56,negated_conjecture,
in(esk2_2(set_intersection2(esk5_0,singleton(esk4_0)),empty_set),set_intersection2(esk5_0,singleton(esk4_0))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_52]),c_0_52]) ).
cnf(c_0_57,plain,
( in(X1,X2)
| ~ in(X1,set_intersection2(X2,X3)) ),
inference(er,[status(thm)],[c_0_53]) ).
cnf(c_0_58,plain,
( X1 = X2
| ~ in(X1,singleton(X2)) ),
inference(er,[status(thm)],[c_0_54]) ).
cnf(c_0_59,plain,
in(esk2_2(set_intersection2(esk5_0,singleton(esk4_0)),empty_set),singleton(esk4_0)),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_60,plain,
in(esk2_2(set_intersection2(esk5_0,singleton(esk4_0)),empty_set),esk5_0),
inference(spm,[status(thm)],[c_0_57,c_0_56]) ).
cnf(c_0_61,plain,
esk2_2(set_intersection2(esk5_0,singleton(esk4_0)),empty_set) = esk4_0,
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_62,negated_conjecture,
~ in(esk4_0,esk5_0),
i_0_27 ).
cnf(c_0_63,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_60,c_0_61]),c_0_62]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : SEU154+1 : TPTP v8.1.0. Released v3.3.0.
% 0.11/0.11 % Command : enigmatic-eprover.py %s %d 1
% 0.11/0.32 % Computer : n022.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 600
% 0.11/0.32 % DateTime : Sun Jun 19 11:59:03 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.18/0.45 # ENIGMATIC: Selected complete mode:
% 7.67/2.48 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.67/2.48 # No SInE strategy applied
% 7.67/2.48 # Trying AutoSched0 for 150 seconds
% 7.67/2.48 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S006A
% 7.67/2.48 # and selection function SelectLargestNegLit.
% 7.67/2.48 #
% 7.67/2.48 # Preprocessing time : 0.023 s
% 7.67/2.48 # Presaturation interreduction done
% 7.67/2.48
% 7.67/2.48 # Proof found!
% 7.67/2.48 # SZS status Theorem
% 7.67/2.48 # SZS output start CNFRefutation
% See solution above
% 7.67/2.48 # Training examples: 0 positive, 0 negative
% 7.67/2.48
% 7.67/2.48 # -------------------------------------------------
% 7.67/2.48 # User time : 0.049 s
% 7.67/2.48 # System time : 0.004 s
% 7.67/2.48 # Total time : 0.053 s
% 7.67/2.48 # Maximum resident set size: 7128 pages
% 7.67/2.48
%------------------------------------------------------------------------------