TSTP Solution File: NUM388+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM388+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n019.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 : Mon Jul 18 08:35:37 EDT 2022
% Result : Theorem 7.72s 2.27s
% Output : CNFRefutation 7.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 10
% Syntax : Number of clauses : 27 ( 12 unt; 2 nHn; 27 RR)
% Number of literals : 52 ( 0 equ; 28 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-1 aty)
% Number of variables : 31 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_56,plain,
( element(X1,X2)
| ~ in(X1,X3)
| ~ element(X3,powerset(X2)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-sfrgmzt7/input.p',i_0_56) ).
cnf(i_0_54,plain,
( element(X1,powerset(X2))
| ~ subset(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-sfrgmzt7/input.p',i_0_54) ).
cnf(i_0_12,plain,
( subset(X1,X2)
| ~ epsilon_transitive(X2)
| ~ in(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-sfrgmzt7/input.p',i_0_12) ).
cnf(i_0_48,negated_conjecture,
in(esk16_0,esk14_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-sfrgmzt7/input.p',i_0_48) ).
cnf(i_0_4,plain,
( epsilon_transitive(X1)
| ~ ordinal(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-sfrgmzt7/input.p',i_0_4) ).
cnf(i_0_50,negated_conjecture,
ordinal(esk15_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-sfrgmzt7/input.p',i_0_50) ).
cnf(i_0_47,negated_conjecture,
in(esk14_0,esk15_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-sfrgmzt7/input.p',i_0_47) ).
cnf(i_0_59,plain,
( ~ empty(X1)
| ~ in(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-sfrgmzt7/input.p',i_0_59) ).
cnf(i_0_53,plain,
( empty(X1)
| in(X2,X1)
| ~ element(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-sfrgmzt7/input.p',i_0_53) ).
cnf(i_0_46,negated_conjecture,
~ in(esk16_0,esk15_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-sfrgmzt7/input.p',i_0_46) ).
cnf(c_0_70,plain,
( element(X1,X2)
| ~ in(X1,X3)
| ~ element(X3,powerset(X2)) ),
i_0_56 ).
cnf(c_0_71,plain,
( element(X1,powerset(X2))
| ~ subset(X1,X2) ),
i_0_54 ).
cnf(c_0_72,plain,
( element(X1,X2)
| ~ subset(X3,X2)
| ~ in(X1,X3) ),
inference(spm,[status(thm)],[c_0_70,c_0_71]) ).
cnf(c_0_73,plain,
( subset(X1,X2)
| ~ epsilon_transitive(X2)
| ~ in(X1,X2) ),
i_0_12 ).
cnf(c_0_74,plain,
( element(X1,X2)
| ~ in(X1,X3)
| ~ in(X3,X2)
| ~ epsilon_transitive(X2) ),
inference(spm,[status(thm)],[c_0_72,c_0_73]) ).
cnf(c_0_75,negated_conjecture,
in(esk16_0,esk14_0),
i_0_48 ).
cnf(c_0_76,plain,
( epsilon_transitive(X1)
| ~ ordinal(X1) ),
i_0_4 ).
cnf(c_0_77,negated_conjecture,
ordinal(esk15_0),
i_0_50 ).
cnf(c_0_78,negated_conjecture,
( element(esk16_0,X1)
| ~ in(esk14_0,X1)
| ~ epsilon_transitive(X1) ),
inference(spm,[status(thm)],[c_0_74,c_0_75]) ).
cnf(c_0_79,negated_conjecture,
epsilon_transitive(esk15_0),
inference(spm,[status(thm)],[c_0_76,c_0_77]) ).
cnf(c_0_80,negated_conjecture,
in(esk14_0,esk15_0),
i_0_47 ).
cnf(c_0_81,plain,
( ~ empty(X1)
| ~ in(X2,X1) ),
i_0_59 ).
cnf(c_0_82,plain,
( empty(X1)
| in(X2,X1)
| ~ element(X2,X1) ),
i_0_53 ).
cnf(c_0_83,negated_conjecture,
element(esk16_0,esk15_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_79]),c_0_80])]) ).
cnf(c_0_84,negated_conjecture,
~ in(esk16_0,esk15_0),
i_0_46 ).
cnf(c_0_85,negated_conjecture,
~ empty(esk15_0),
inference(spm,[status(thm)],[c_0_81,c_0_80]) ).
cnf(c_0_86,plain,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_83]),c_0_84]),c_0_85]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : NUM388+1 : TPTP v8.1.0. Released v3.2.0.
% 0.06/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.32 % Computer : n019.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 600
% 0.12/0.32 % DateTime : Thu Jul 7 10:34:25 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.17/0.44 # ENIGMATIC: Selected complete mode:
% 7.72/2.27 # ENIGMATIC: Solved by autoschedule:
% 7.72/2.27 # No SInE strategy applied
% 7.72/2.27 # Trying AutoSched0 for 150 seconds
% 7.72/2.27 # AutoSched0-Mode selected heuristic G_E___008_C45_F1_PI_SE_Q4_CS_SP_S0Y
% 7.72/2.27 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.72/2.27 #
% 7.72/2.27 # Preprocessing time : 0.023 s
% 7.72/2.27
% 7.72/2.27 # Proof found!
% 7.72/2.27 # SZS status Theorem
% 7.72/2.27 # SZS output start CNFRefutation
% See solution above
% 7.72/2.27 # Training examples: 0 positive, 0 negative
% 7.72/2.27
% 7.72/2.27 # -------------------------------------------------
% 7.72/2.27 # User time : 0.027 s
% 7.72/2.27 # System time : 0.005 s
% 7.72/2.27 # Total time : 0.032 s
% 7.72/2.27 # Maximum resident set size: 7124 pages
% 7.72/2.27
%------------------------------------------------------------------------------