TSTP Solution File: SEU102+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU102+1 : TPTP v8.1.0. Released v3.2.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:28 EDT 2022
% Result : Theorem 6.59s 2.24s
% Output : CNFRefutation 6.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 10
% Syntax : Number of clauses : 31 ( 13 unt; 6 nHn; 29 RR)
% Number of literals : 67 ( 6 equ; 34 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-3 aty)
% Number of variables : 38 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_8,plain,
( empty(X1)
| element(prebool_difference(X1,X2,X3),X1)
| ~ preboolean(X1)
| ~ element(X3,X1)
| ~ element(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-q10xte98/lgb.p',i_0_8) ).
cnf(i_0_48,negated_conjecture,
element(esk12_0,esk13_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-q10xte98/lgb.p',i_0_48) ).
cnf(i_0_50,negated_conjecture,
preboolean(esk13_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-q10xte98/lgb.p',i_0_50) ).
cnf(i_0_51,negated_conjecture,
~ empty(esk13_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-q10xte98/lgb.p',i_0_51) ).
cnf(i_0_45,plain,
( prebool_difference(X1,X2,X3) = set_difference(X2,X3)
| empty(X1)
| ~ preboolean(X1)
| ~ element(X3,X1)
| ~ element(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-q10xte98/lgb.p',i_0_45) ).
cnf(i_0_54,plain,
( empty(X1)
| in(X2,X1)
| ~ element(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-q10xte98/lgb.p',i_0_54) ).
cnf(i_0_7,plain,
set_difference(X1,set_difference(X1,X2)) = set_difference(X2,set_difference(X2,X1)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-q10xte98/lgb.p',i_0_7) ).
cnf(i_0_52,plain,
( element(X1,X2)
| ~ in(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-q10xte98/lgb.p',i_0_52) ).
cnf(i_0_47,negated_conjecture,
~ element(set_difference(esk11_0,set_difference(esk11_0,esk12_0)),esk13_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-q10xte98/lgb.p',i_0_47) ).
cnf(i_0_49,negated_conjecture,
element(esk11_0,esk13_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-q10xte98/lgb.p',i_0_49) ).
cnf(c_0_65,plain,
( empty(X1)
| element(prebool_difference(X1,X2,X3),X1)
| ~ preboolean(X1)
| ~ element(X3,X1)
| ~ element(X2,X1) ),
i_0_8 ).
cnf(c_0_66,negated_conjecture,
element(esk12_0,esk13_0),
i_0_48 ).
cnf(c_0_67,negated_conjecture,
preboolean(esk13_0),
i_0_50 ).
cnf(c_0_68,negated_conjecture,
~ empty(esk13_0),
i_0_51 ).
cnf(c_0_69,plain,
( prebool_difference(X1,X2,X3) = set_difference(X2,X3)
| empty(X1)
| ~ preboolean(X1)
| ~ element(X3,X1)
| ~ element(X2,X1) ),
i_0_45 ).
cnf(c_0_70,negated_conjecture,
( element(prebool_difference(esk13_0,X1,esk12_0),esk13_0)
| ~ element(X1,esk13_0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_67])]),c_0_68]) ).
cnf(c_0_71,negated_conjecture,
( prebool_difference(esk13_0,X1,esk12_0) = set_difference(X1,esk12_0)
| ~ element(X1,esk13_0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_66]),c_0_67])]),c_0_68]) ).
cnf(c_0_72,negated_conjecture,
( element(set_difference(X1,esk12_0),esk13_0)
| ~ element(X1,esk13_0) ),
inference(spm,[status(thm)],[c_0_70,c_0_71]) ).
cnf(c_0_73,plain,
( empty(X1)
| in(X2,X1)
| ~ element(X2,X1) ),
i_0_54 ).
cnf(c_0_74,plain,
( element(prebool_difference(esk13_0,X1,set_difference(X2,esk12_0)),esk13_0)
| ~ element(X1,esk13_0)
| ~ element(X2,esk13_0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_72]),c_0_67])]),c_0_68]) ).
cnf(c_0_75,plain,
( in(prebool_difference(esk13_0,X1,set_difference(X2,esk12_0)),esk13_0)
| ~ element(X1,esk13_0)
| ~ element(X2,esk13_0) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_74]),c_0_68]) ).
cnf(c_0_76,plain,
( prebool_difference(esk13_0,X1,set_difference(X2,esk12_0)) = set_difference(X1,set_difference(X2,esk12_0))
| ~ element(X1,esk13_0)
| ~ element(X2,esk13_0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_72]),c_0_67])]),c_0_68]) ).
cnf(c_0_77,plain,
( in(set_difference(X1,set_difference(X2,esk12_0)),esk13_0)
| ~ element(X1,esk13_0)
| ~ element(X2,esk13_0) ),
inference(spm,[status(thm)],[c_0_75,c_0_76]) ).
cnf(c_0_78,plain,
set_difference(X1,set_difference(X1,X2)) = set_difference(X2,set_difference(X2,X1)),
i_0_7 ).
cnf(c_0_79,plain,
( in(set_difference(esk12_0,set_difference(esk12_0,X1)),esk13_0)
| ~ element(X1,esk13_0) ),
inference(spm,[status(thm)],[c_0_77,c_0_78]) ).
cnf(c_0_80,plain,
( element(X1,X2)
| ~ in(X1,X2) ),
i_0_52 ).
cnf(c_0_81,plain,
( in(set_difference(X1,set_difference(X1,esk12_0)),esk13_0)
| ~ element(X1,esk13_0) ),
inference(spm,[status(thm)],[c_0_79,c_0_78]) ).
cnf(c_0_82,negated_conjecture,
~ element(set_difference(esk11_0,set_difference(esk11_0,esk12_0)),esk13_0),
i_0_47 ).
cnf(c_0_83,plain,
( element(set_difference(X1,set_difference(X1,esk12_0)),esk13_0)
| ~ element(X1,esk13_0) ),
inference(spm,[status(thm)],[c_0_80,c_0_81]) ).
cnf(c_0_84,negated_conjecture,
element(esk11_0,esk13_0),
i_0_49 ).
cnf(c_0_85,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_83]),c_0_84])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU102+1 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n022.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 : Sat Jun 18 19:40:18 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected complete mode:
% 6.59/2.24 # ENIGMATIC: Solved by autoschedule-lgb:
% 6.59/2.24 # No SInE strategy applied
% 6.59/2.24 # Trying AutoSched0 for 150 seconds
% 6.59/2.24 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 6.59/2.24 # and selection function SelectComplexExceptUniqMaxHorn.
% 6.59/2.24 #
% 6.59/2.24 # Preprocessing time : 0.014 s
% 6.59/2.24 # Presaturation interreduction done
% 6.59/2.24
% 6.59/2.24 # Proof found!
% 6.59/2.24 # SZS status Theorem
% 6.59/2.24 # SZS output start CNFRefutation
% See solution above
% 6.59/2.24 # Training examples: 0 positive, 0 negative
% 6.59/2.24
% 6.59/2.24 # -------------------------------------------------
% 6.59/2.24 # User time : 0.017 s
% 6.59/2.24 # System time : 0.003 s
% 6.59/2.24 # Total time : 0.020 s
% 6.59/2.24 # Maximum resident set size: 7128 pages
% 6.59/2.24
%------------------------------------------------------------------------------