TSTP Solution File: SEU171+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU171+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n014.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:39:09 EDT 2022
% Result : Theorem 7.59s 2.39s
% Output : CNFRefutation 7.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 9
% Syntax : Number of clauses : 24 ( 14 unt; 6 nHn; 23 RR)
% Number of literals : 41 ( 9 equ; 18 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 21 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_12,plain,
( subset_complement(X1,X2) = set_difference(X1,X2)
| ~ element(X2,powerset(X1)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ezy3akrr/input.p',i_0_12) ).
cnf(i_0_33,negated_conjecture,
element(esk8_0,powerset(esk7_0)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ezy3akrr/input.p',i_0_33) ).
cnf(i_0_5,plain,
( empty(X1)
| in(X2,X1)
| ~ element(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ezy3akrr/input.p',i_0_5) ).
cnf(i_0_32,negated_conjecture,
element(esk9_0,esk7_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ezy3akrr/input.p',i_0_32) ).
cnf(i_0_30,negated_conjecture,
~ in(esk9_0,subset_complement(esk7_0,esk8_0)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ezy3akrr/input.p',i_0_30) ).
cnf(i_0_9,plain,
( in(X1,X2)
| in(X1,X3)
| X2 != set_difference(X4,X3)
| ~ in(X1,X4) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ezy3akrr/input.p',i_0_9) ).
cnf(i_0_35,plain,
( X1 = empty_set
| ~ empty(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ezy3akrr/input.p',i_0_35) ).
cnf(i_0_34,negated_conjecture,
esk7_0 != empty_set,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ezy3akrr/input.p',i_0_34) ).
cnf(i_0_31,negated_conjecture,
~ in(esk9_0,esk8_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ezy3akrr/input.p',i_0_31) ).
cnf(c_0_45,plain,
( subset_complement(X1,X2) = set_difference(X1,X2)
| ~ element(X2,powerset(X1)) ),
i_0_12 ).
cnf(c_0_46,negated_conjecture,
element(esk8_0,powerset(esk7_0)),
i_0_33 ).
cnf(c_0_47,plain,
( empty(X1)
| in(X2,X1)
| ~ element(X2,X1) ),
i_0_5 ).
cnf(c_0_48,negated_conjecture,
element(esk9_0,esk7_0),
i_0_32 ).
cnf(c_0_49,negated_conjecture,
~ in(esk9_0,subset_complement(esk7_0,esk8_0)),
i_0_30 ).
cnf(c_0_50,negated_conjecture,
subset_complement(esk7_0,esk8_0) = set_difference(esk7_0,esk8_0),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_51,plain,
( in(X1,X2)
| in(X1,X3)
| X2 != set_difference(X4,X3)
| ~ in(X1,X4) ),
i_0_9 ).
cnf(c_0_52,plain,
( X1 = empty_set
| ~ empty(X1) ),
i_0_35 ).
cnf(c_0_53,negated_conjecture,
( in(esk9_0,esk7_0)
| empty(esk7_0) ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_54,negated_conjecture,
esk7_0 != empty_set,
i_0_34 ).
cnf(c_0_55,negated_conjecture,
~ in(esk9_0,set_difference(esk7_0,esk8_0)),
inference(rw,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_56,plain,
( in(X1,set_difference(X2,X3))
| in(X1,X3)
| ~ in(X1,X2) ),
inference(er,[status(thm)],[c_0_51]) ).
cnf(c_0_57,plain,
in(esk9_0,esk7_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_54]) ).
cnf(c_0_58,negated_conjecture,
~ in(esk9_0,esk8_0),
i_0_31 ).
cnf(c_0_59,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_57])]),c_0_58]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU171+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n014.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 09:05:34 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.20/0.44 # ENIGMATIC: Selected complete mode:
% 7.59/2.39 # ENIGMATIC: Solved by autoschedule:
% 7.59/2.39 # No SInE strategy applied
% 7.59/2.39 # Trying AutoSched0 for 150 seconds
% 7.59/2.39 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S02CN
% 7.59/2.39 # and selection function SelectAntiRROptimalLit.
% 7.59/2.39 #
% 7.59/2.39 # Preprocessing time : 0.024 s
% 7.59/2.39 # Presaturation interreduction done
% 7.59/2.39
% 7.59/2.39 # Proof found!
% 7.59/2.39 # SZS status Theorem
% 7.59/2.39 # SZS output start CNFRefutation
% See solution above
% 7.59/2.39 # Training examples: 0 positive, 0 negative
% 7.59/2.39
% 7.59/2.39 # -------------------------------------------------
% 7.59/2.39 # User time : 0.024 s
% 7.59/2.39 # System time : 0.009 s
% 7.59/2.39 # Total time : 0.033 s
% 7.59/2.39 # Maximum resident set size: 7120 pages
% 7.59/2.39
%------------------------------------------------------------------------------