%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : KRS181+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n028.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 : Sun Jul 17 02:56:02 EDT 2022
% Result : Theorem 7.98s 2.54s
% Output : CNFRefutation 7.98s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 9
% Syntax : Number of clauses : 27 ( 8 unt; 9 nHn; 18 RR)
% Number of literals : 56 ( 0 equ; 22 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 51 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_12,plain,
( nota(X1,X2)
| status(X3,X4,X2)
| ~ status(X3,X4,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jliwsmco/input.p',i_0_12) ).
cnf(i_0_3,plain,
( isa(X1,X2)
| status(esk1_2(X1,X2),esk2_2(X1,X2),X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jliwsmco/input.p',i_0_3) ).
cnf(i_0_1,plain,
( status(X1,X2,X3)
| ~ isa(X4,X3)
| ~ status(X1,X2,X4) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jliwsmco/input.p',i_0_1) ).
cnf(i_0_11,plain,
( status(esk7_2(X1,X2),esk8_2(X1,X2),X1)
| ~ nota(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jliwsmco/input.p',i_0_11) ).
cnf(i_0_10,plain,
( ~ nota(X1,X2)
| ~ status(esk7_2(X1,X2),esk8_2(X1,X2),X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jliwsmco/input.p',i_0_10) ).
cnf(i_0_2,plain,
( isa(X1,X2)
| ~ status(esk1_2(X1,X2),esk2_2(X1,X2),X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jliwsmco/input.p',i_0_2) ).
cnf(i_0_15,negated_conjecture,
isa(esk9_0,esk10_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jliwsmco/input.p',i_0_15) ).
cnf(i_0_14,negated_conjecture,
nota(esk9_0,esk11_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jliwsmco/input.p',i_0_14) ).
cnf(i_0_13,negated_conjecture,
~ nota(esk10_0,esk11_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jliwsmco/input.p',i_0_13) ).
cnf(c_0_25,plain,
( nota(X1,X2)
| status(X3,X4,X2)
| ~ status(X3,X4,X1) ),
i_0_12 ).
cnf(c_0_26,plain,
( isa(X1,X2)
| status(esk1_2(X1,X2),esk2_2(X1,X2),X1) ),
i_0_3 ).
cnf(c_0_27,plain,
( status(X1,X2,X3)
| ~ isa(X4,X3)
| ~ status(X1,X2,X4) ),
i_0_1 ).
cnf(c_0_28,plain,
( status(esk7_2(X1,X2),esk8_2(X1,X2),X1)
| ~ nota(X1,X2) ),
i_0_11 ).
cnf(c_0_29,plain,
( status(esk1_2(X1,X2),esk2_2(X1,X2),X3)
| nota(X1,X3)
| isa(X1,X2) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_30,plain,
( ~ nota(X1,X2)
| ~ status(esk7_2(X1,X2),esk8_2(X1,X2),X2) ),
i_0_10 ).
cnf(c_0_31,plain,
( status(esk7_2(X1,X2),esk8_2(X1,X2),X3)
| ~ nota(X1,X2)
| ~ isa(X1,X3) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_32,plain,
( isa(X1,X2)
| ~ status(esk1_2(X1,X2),esk2_2(X1,X2),X2) ),
i_0_2 ).
cnf(c_0_33,plain,
( status(esk1_2(X1,X2),esk2_2(X1,X2),X3)
| nota(X1,X4)
| nota(X4,X3)
| isa(X1,X2) ),
inference(spm,[status(thm)],[c_0_25,c_0_29]) ).
cnf(c_0_34,plain,
( ~ nota(X1,X2)
| ~ isa(X1,X2) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_35,plain,
( nota(X1,X2)
| nota(X3,X1)
| isa(X3,X2) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_36,negated_conjecture,
isa(esk9_0,esk10_0),
i_0_15 ).
cnf(c_0_37,plain,
( nota(X1,X2)
| nota(X2,X3)
| ~ nota(X1,X3) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_38,negated_conjecture,
nota(esk9_0,esk11_0),
i_0_14 ).
cnf(c_0_39,negated_conjecture,
~ nota(esk9_0,esk10_0),
inference(spm,[status(thm)],[c_0_34,c_0_36]) ).
cnf(c_0_40,negated_conjecture,
( nota(X1,esk11_0)
| nota(esk9_0,X1) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_41,negated_conjecture,
~ nota(esk10_0,esk11_0),
i_0_13 ).
cnf(c_0_42,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : KRS181+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% 0.07/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n028.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 : Tue Jun 7 07:22:31 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected SinE mode:
% 0.19/0.45 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.45 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.45 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.45 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.98/2.54 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 7.98/2.54 # Version: 2.1pre011
% 7.98/2.54 # Preprocessing time : 0.010 s
% 7.98/2.54
% 7.98/2.54 # Proof found!
% 7.98/2.54 # SZS status Theorem
% 7.98/2.54 # SZS output start CNFRefutation
% See solution above
% 7.98/2.54 # Proof object total steps : 27
% 7.98/2.54 # Proof object clause steps : 18
% 7.98/2.54 # Proof object formula steps : 9
% 7.98/2.54 # Proof object conjectures : 9
% 7.98/2.54 # Proof object clause conjectures : 6
% 7.98/2.54 # Proof object formula conjectures : 3
% 7.98/2.54 # Proof object initial clauses used : 9
% 7.98/2.54 # Proof object initial formulas used : 9
% 7.98/2.54 # Proof object generating inferences : 9
% 7.98/2.54 # Proof object simplifying inferences : 1
% 7.98/2.54 # Training examples: 0 positive, 0 negative
% 7.98/2.54 # Parsed axioms : 19
% 7.98/2.54 # Removed by relevancy pruning/SinE : 0
% 7.98/2.54 # Initial clauses : 19
% 7.98/2.54 # Removed in clause preprocessing : 0
% 7.98/2.54 # Initial clauses in saturation : 19
% 7.98/2.54 # Processed clauses : 145
% 7.98/2.54 # ...of these trivial : 0
% 7.98/2.54 # ...subsumed : 28
% 7.98/2.54 # ...remaining for further processing : 117
% 7.98/2.54 # Other redundant clauses eliminated : 0
% 7.98/2.54 # Clauses deleted for lack of memory : 0
% 7.98/2.54 # Backward-subsumed : 0
% 7.98/2.54 # Backward-rewritten : 0
% 7.98/2.54 # Generated clauses : 448
% 7.98/2.54 # ...of the previous two non-trivial : 433
% 7.98/2.54 # Contextual simplify-reflections : 2
% 7.98/2.54 # Paramodulations : 448
% 7.98/2.54 # Factorizations : 0
% 7.98/2.54 # Equation resolutions : 0
% 7.98/2.54 # Propositional unsat checks : 0
% 7.98/2.54 # Propositional unsat check successes : 0
% 7.98/2.54 # Current number of processed clauses : 117
% 7.98/2.54 # Positive orientable unit clauses : 4
% 7.98/2.54 # Positive unorientable unit clauses: 0
% 7.98/2.54 # Negative unit clauses : 5
% 7.98/2.54 # Non-unit-clauses : 108
% 7.98/2.54 # Current number of unprocessed clauses: 306
% 7.98/2.54 # ...number of literals in the above : 1026
% 7.98/2.54 # Current number of archived formulas : 0
% 7.98/2.54 # Current number of archived clauses : 0
% 7.98/2.54 # Clause-clause subsumption calls (NU) : 2924
% 7.98/2.54 # Rec. Clause-clause subsumption calls : 1758
% 7.98/2.54 # Non-unit clause-clause subsumptions : 22
% 7.98/2.54 # Unit Clause-clause subsumption calls : 8
% 7.98/2.54 # Rewrite failures with RHS unbound : 0
% 7.98/2.54 # BW rewrite match attempts : 3
% 7.98/2.54 # BW rewrite match successes : 0
% 7.98/2.54 # Condensation attempts : 0
% 7.98/2.54 # Condensation successes : 0
% 7.98/2.54 # Termbank termtop insertions : 5004
% 7.98/2.54
% 7.98/2.54 # -------------------------------------------------
% 7.98/2.54 # User time : 0.014 s
% 7.98/2.54 # System time : 0.003 s
% 7.98/2.54 # Total time : 0.017 s
% 7.98/2.54 # ...preprocessing : 0.010 s
% 7.98/2.54 # ...main loop : 0.007 s
% 7.98/2.54 # Maximum resident set size: 7132 pages
% 7.98/2.54
%------------------------------------------------------------------------------