%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : KRS257+1 : TPTP v8.1.0. Bugfixed v5.4.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 : Sun Jul 17 02:56:14 EDT 2022
% Result : Theorem 7.68s 2.31s
% Output : CNFRefutation 7.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 6
% Syntax : Number of clauses : 16 ( 6 unt; 2 nHn; 13 RR)
% Number of literals : 30 ( 0 equ; 14 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 26 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_77,plain,
( status(X1,X2,thm)
| ~ model(esk51_2(X1,X2),X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xzuma4qx/input.p',i_0_77) ).
cnf(i_0_78,plain,
( status(X1,X2,thm)
| model(esk51_2(X1,X2),X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xzuma4qx/input.p',i_0_78) ).
cnf(i_0_29,plain,
( mighta(X1,X2)
| ~ status(X3,X4,X2)
| ~ status(X3,X4,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xzuma4qx/input.p',i_0_29) ).
cnf(i_0_57,plain,
( status(X1,X2,sat)
| ~ model(X3,X2)
| ~ model(X3,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xzuma4qx/input.p',i_0_57) ).
cnf(i_0_61,plain,
model(esk40_0,esk39_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xzuma4qx/input.p',i_0_61) ).
cnf(i_0_30,negated_conjecture,
~ mighta(sat,thm),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xzuma4qx/input.p',i_0_30) ).
cnf(c_0_85,plain,
( status(X1,X2,thm)
| ~ model(esk51_2(X1,X2),X2) ),
i_0_77 ).
cnf(c_0_86,plain,
( status(X1,X2,thm)
| model(esk51_2(X1,X2),X1) ),
i_0_78 ).
cnf(c_0_87,plain,
( mighta(X1,X2)
| ~ status(X3,X4,X2)
| ~ status(X3,X4,X1) ),
i_0_29 ).
cnf(c_0_88,plain,
status(X1,X1,thm),
inference(spm,[status(thm)],[c_0_85,c_0_86]) ).
cnf(c_0_89,plain,
( status(X1,X2,sat)
| ~ model(X3,X2)
| ~ model(X3,X1) ),
i_0_57 ).
cnf(c_0_90,plain,
model(esk40_0,esk39_0),
i_0_61 ).
cnf(c_0_91,plain,
( mighta(X1,thm)
| ~ status(X2,X2,X1) ),
inference(spm,[status(thm)],[c_0_87,c_0_88]) ).
cnf(c_0_92,plain,
( status(X1,esk39_0,sat)
| ~ model(esk40_0,X1) ),
inference(spm,[status(thm)],[c_0_89,c_0_90]) ).
cnf(c_0_93,negated_conjecture,
~ mighta(sat,thm),
i_0_30 ).
cnf(c_0_94,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_91,c_0_92]),c_0_90])]),c_0_93]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : KRS257+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% 0.03/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.35 % Computer : n019.cluster.edu
% 0.12/0.35 % Model : x86_64 x86_64
% 0.12/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.35 % Memory : 8042.1875MB
% 0.12/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.35 % CPULimit : 300
% 0.12/0.35 % WCLimit : 600
% 0.12/0.35 % DateTime : Tue Jun 7 09:52:42 EDT 2022
% 0.12/0.35 % CPUTime :
% 0.19/0.46 # ENIGMATIC: Selected SinE mode:
% 0.19/0.47 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.47 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.47 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.47 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.68/2.31 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 7.68/2.31 # Version: 2.1pre011
% 7.68/2.31 # Preprocessing time : 0.012 s
% 7.68/2.31
% 7.68/2.31 # Proof found!
% 7.68/2.31 # SZS status Theorem
% 7.68/2.31 # SZS output start CNFRefutation
% See solution above
% 7.68/2.31 # Proof object total steps : 16
% 7.68/2.31 # Proof object clause steps : 10
% 7.68/2.31 # Proof object formula steps : 6
% 7.68/2.31 # Proof object conjectures : 2
% 7.68/2.31 # Proof object clause conjectures : 1
% 7.68/2.31 # Proof object formula conjectures : 1
% 7.68/2.31 # Proof object initial clauses used : 6
% 7.68/2.31 # Proof object initial formulas used : 6
% 7.68/2.31 # Proof object generating inferences : 4
% 7.68/2.31 # Proof object simplifying inferences : 3
% 7.68/2.31 # Training examples: 0 positive, 0 negative
% 7.68/2.31 # Parsed axioms : 109
% 7.68/2.31 # Removed by relevancy pruning/SinE : 0
% 7.68/2.31 # Initial clauses : 109
% 7.68/2.31 # Removed in clause preprocessing : 0
% 7.68/2.31 # Initial clauses in saturation : 109
% 7.68/2.31 # Processed clauses : 350
% 7.68/2.31 # ...of these trivial : 30
% 7.68/2.31 # ...subsumed : 23
% 7.68/2.31 # ...remaining for further processing : 297
% 7.68/2.31 # Other redundant clauses eliminated : 0
% 7.68/2.31 # Clauses deleted for lack of memory : 0
% 7.68/2.31 # Backward-subsumed : 0
% 7.68/2.31 # Backward-rewritten : 0
% 7.68/2.31 # Generated clauses : 2808
% 7.68/2.31 # ...of the previous two non-trivial : 2584
% 7.68/2.31 # Contextual simplify-reflections : 0
% 7.68/2.31 # Paramodulations : 2804
% 7.68/2.31 # Factorizations : 4
% 7.68/2.31 # Equation resolutions : 0
% 7.68/2.31 # Propositional unsat checks : 0
% 7.68/2.31 # Propositional unsat check successes : 0
% 7.68/2.31 # Current number of processed clauses : 297
% 7.68/2.31 # Positive orientable unit clauses : 73
% 7.68/2.31 # Positive unorientable unit clauses: 0
% 7.68/2.31 # Negative unit clauses : 42
% 7.68/2.31 # Non-unit-clauses : 182
% 7.68/2.31 # Current number of unprocessed clauses: 2343
% 7.68/2.31 # ...number of literals in the above : 6253
% 7.68/2.31 # Current number of archived formulas : 0
% 7.68/2.31 # Current number of archived clauses : 0
% 7.68/2.31 # Clause-clause subsumption calls (NU) : 3977
% 7.68/2.31 # Rec. Clause-clause subsumption calls : 2576
% 7.68/2.31 # Non-unit clause-clause subsumptions : 5
% 7.68/2.31 # Unit Clause-clause subsumption calls : 2446
% 7.68/2.31 # Rewrite failures with RHS unbound : 0
% 7.68/2.31 # BW rewrite match attempts : 241
% 7.68/2.31 # BW rewrite match successes : 0
% 7.68/2.31 # Condensation attempts : 0
% 7.68/2.31 # Condensation successes : 0
% 7.68/2.31 # Termbank termtop insertions : 29653
% 7.68/2.31
% 7.68/2.31 # -------------------------------------------------
% 7.68/2.31 # User time : 0.039 s
% 7.68/2.31 # System time : 0.002 s
% 7.68/2.31 # Total time : 0.041 s
% 7.68/2.31 # ...preprocessing : 0.012 s
% 7.68/2.31 # ...main loop : 0.029 s
% 7.68/2.31 # Maximum resident set size: 7128 pages
% 7.68/2.31
%------------------------------------------------------------------------------