TSTP Solution File: SEU126+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU126+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n016.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:38 EDT 2022
% Result : Theorem 8.07s 2.29s
% Output : CNFRefutation 8.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 7
% Syntax : Number of clauses : 18 ( 12 unt; 0 nHn; 12 RR)
% Number of literals : 28 ( 9 equ; 13 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 24 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_4,plain,
( X1 = X2
| ~ subset(X2,X1)
| ~ subset(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-imlyua05/lgb.p',i_0_4) ).
cnf(i_0_51,lemma,
subset(X1,set_union2(X1,X2)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-imlyua05/lgb.p',i_0_51) ).
cnf(i_0_38,negated_conjecture,
set_union2(esk7_0,esk8_0) != esk8_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-imlyua05/lgb.p',i_0_38) ).
cnf(i_0_2,plain,
set_union2(X1,X2) = set_union2(X2,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-imlyua05/lgb.p',i_0_2) ).
cnf(i_0_53,lemma,
( subset(set_union2(X1,X2),X3)
| ~ subset(X2,X3)
| ~ subset(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-imlyua05/lgb.p',i_0_53) ).
cnf(i_0_36,plain,
subset(X1,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-imlyua05/lgb.p',i_0_36) ).
cnf(i_0_39,negated_conjecture,
subset(esk7_0,esk8_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-imlyua05/lgb.p',i_0_39) ).
cnf(c_0_61,plain,
( X1 = X2
| ~ subset(X2,X1)
| ~ subset(X1,X2) ),
i_0_4 ).
cnf(c_0_62,lemma,
subset(X1,set_union2(X1,X2)),
i_0_51 ).
cnf(c_0_63,negated_conjecture,
set_union2(esk7_0,esk8_0) != esk8_0,
i_0_38 ).
cnf(c_0_64,plain,
set_union2(X1,X2) = set_union2(X2,X1),
i_0_2 ).
cnf(c_0_65,lemma,
( set_union2(X1,X2) = X1
| ~ subset(set_union2(X1,X2),X1) ),
inference(spm,[status(thm)],[c_0_61,c_0_62]) ).
cnf(c_0_66,lemma,
( subset(set_union2(X1,X2),X3)
| ~ subset(X2,X3)
| ~ subset(X1,X3) ),
i_0_53 ).
cnf(c_0_67,plain,
subset(X1,X1),
i_0_36 ).
cnf(c_0_68,negated_conjecture,
set_union2(esk8_0,esk7_0) != esk8_0,
inference(rw,[status(thm)],[c_0_63,c_0_64]) ).
cnf(c_0_69,lemma,
( set_union2(X1,X2) = X1
| ~ subset(X2,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_67])]) ).
cnf(c_0_70,negated_conjecture,
subset(esk7_0,esk8_0),
i_0_39 ).
cnf(c_0_71,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_70])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SEU126+2 : TPTP v8.1.0. Released v3.3.0.
% 0.10/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n016.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 : Mon Jun 20 10:49:56 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 8.07/2.29 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.07/2.29 # No SInE strategy applied
% 8.07/2.29 # Trying AutoSched0 for 150 seconds
% 8.07/2.29 # AutoSched0-Mode selected heuristic G_E___107_B42_F1_PI_SE_Q4_CS_SP_PS_S5PRR_S0Y
% 8.07/2.29 # and selection function SelectMaxLComplexAvoidPosPred.
% 8.07/2.29 #
% 8.07/2.29 # Preprocessing time : 0.023 s
% 8.07/2.29 # Presaturation interreduction done
% 8.07/2.29
% 8.07/2.29 # Proof found!
% 8.07/2.29 # SZS status Theorem
% 8.07/2.29 # SZS output start CNFRefutation
% See solution above
% 8.07/2.29 # Training examples: 0 positive, 0 negative
% 8.07/2.29
% 8.07/2.29 # -------------------------------------------------
% 8.07/2.29 # User time : 0.033 s
% 8.07/2.29 # System time : 0.003 s
% 8.07/2.29 # Total time : 0.035 s
% 8.07/2.29 # Maximum resident set size: 7124 pages
% 8.07/2.29
%------------------------------------------------------------------------------