TSTP Solution File: KRS179+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : KRS179+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n017.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.32s 2.34s
% Output : CNFRefutation 7.32s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of clauses : 17 ( 7 unt; 5 nHn; 12 RR)
% Number of literals : 33 ( 0 equ; 13 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 26 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_1,plain,
( status(X1,X2,X3)
| ~ isa(X4,X3)
| ~ status(X1,X2,X4) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tlw2oj37/input.p',i_0_1) ).
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-tlw2oj37/input.p',i_0_3) ).
cnf(i_0_5,negated_conjecture,
isa(esk4_0,esk5_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tlw2oj37/input.p',i_0_5) ).
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-tlw2oj37/input.p',i_0_2) ).
cnf(i_0_4,negated_conjecture,
~ isa(esk3_0,esk5_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tlw2oj37/input.p',i_0_4) ).
cnf(i_0_6,negated_conjecture,
isa(esk3_0,esk4_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tlw2oj37/input.p',i_0_6) ).
cnf(c_0_13,plain,
( status(X1,X2,X3)
| ~ isa(X4,X3)
| ~ status(X1,X2,X4) ),
i_0_1 ).
cnf(c_0_14,plain,
( isa(X1,X2)
| status(esk1_2(X1,X2),esk2_2(X1,X2),X1) ),
i_0_3 ).
cnf(c_0_15,plain,
( status(esk1_2(X1,X2),esk2_2(X1,X2),X3)
| isa(X1,X2)
| ~ isa(X1,X3) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_16,plain,
( status(esk1_2(X1,X2),esk2_2(X1,X2),X3)
| isa(X1,X2)
| ~ isa(X4,X3)
| ~ isa(X1,X4) ),
inference(spm,[status(thm)],[c_0_13,c_0_15]) ).
cnf(c_0_17,negated_conjecture,
isa(esk4_0,esk5_0),
i_0_5 ).
cnf(c_0_18,plain,
( isa(X1,X2)
| ~ status(esk1_2(X1,X2),esk2_2(X1,X2),X2) ),
i_0_2 ).
cnf(c_0_19,negated_conjecture,
( status(esk1_2(X1,X2),esk2_2(X1,X2),esk5_0)
| isa(X1,X2)
| ~ isa(X1,esk4_0) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,negated_conjecture,
~ isa(esk3_0,esk5_0),
i_0_4 ).
cnf(c_0_21,plain,
( isa(X1,esk5_0)
| ~ isa(X1,esk4_0) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,negated_conjecture,
isa(esk3_0,esk4_0),
i_0_6 ).
cnf(c_0_23,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : KRS179+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n017.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 : Tue Jun 7 05:26:19 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected SinE mode:
% 0.19/0.46 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.46 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.46 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.46 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.32/2.34 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 7.32/2.34 # Version: 2.1pre011
% 7.32/2.34 # Preprocessing time : 0.017 s
% 7.32/2.34
% 7.32/2.34 # Proof found!
% 7.32/2.34 # SZS status Theorem
% 7.32/2.34 # SZS output start CNFRefutation
% See solution above
% 7.32/2.34 # Proof object total steps : 17
% 7.32/2.34 # Proof object clause steps : 11
% 7.32/2.34 # Proof object formula steps : 6
% 7.32/2.34 # Proof object conjectures : 8
% 7.32/2.34 # Proof object clause conjectures : 5
% 7.32/2.34 # Proof object formula conjectures : 3
% 7.32/2.34 # Proof object initial clauses used : 6
% 7.32/2.34 # Proof object initial formulas used : 6
% 7.32/2.34 # Proof object generating inferences : 5
% 7.32/2.34 # Proof object simplifying inferences : 2
% 7.32/2.34 # Training examples: 0 positive, 0 negative
% 7.32/2.34 # Parsed axioms : 19
% 7.32/2.34 # Removed by relevancy pruning/SinE : 0
% 7.32/2.34 # Initial clauses : 19
% 7.32/2.34 # Removed in clause preprocessing : 0
% 7.32/2.34 # Initial clauses in saturation : 19
% 7.32/2.34 # Processed clauses : 205
% 7.32/2.34 # ...of these trivial : 0
% 7.32/2.34 # ...subsumed : 57
% 7.32/2.34 # ...remaining for further processing : 148
% 7.32/2.34 # Other redundant clauses eliminated : 0
% 7.32/2.34 # Clauses deleted for lack of memory : 0
% 7.32/2.34 # Backward-subsumed : 0
% 7.32/2.34 # Backward-rewritten : 0
% 7.32/2.34 # Generated clauses : 701
% 7.32/2.34 # ...of the previous two non-trivial : 677
% 7.32/2.34 # Contextual simplify-reflections : 2
% 7.32/2.34 # Paramodulations : 699
% 7.32/2.34 # Factorizations : 2
% 7.32/2.34 # Equation resolutions : 0
% 7.32/2.34 # Propositional unsat checks : 0
% 7.32/2.34 # Propositional unsat check successes : 0
% 7.32/2.34 # Current number of processed clauses : 148
% 7.32/2.34 # Positive orientable unit clauses : 3
% 7.32/2.34 # Positive unorientable unit clauses: 0
% 7.32/2.34 # Negative unit clauses : 2
% 7.32/2.34 # Non-unit-clauses : 143
% 7.32/2.34 # Current number of unprocessed clauses: 491
% 7.32/2.34 # ...number of literals in the above : 1747
% 7.32/2.34 # Current number of archived formulas : 0
% 7.32/2.34 # Current number of archived clauses : 0
% 7.32/2.34 # Clause-clause subsumption calls (NU) : 5117
% 7.32/2.34 # Rec. Clause-clause subsumption calls : 3295
% 7.32/2.34 # Non-unit clause-clause subsumptions : 59
% 7.32/2.34 # Unit Clause-clause subsumption calls : 18
% 7.32/2.34 # Rewrite failures with RHS unbound : 0
% 7.32/2.34 # BW rewrite match attempts : 5
% 7.32/2.34 # BW rewrite match successes : 0
% 7.32/2.34 # Condensation attempts : 0
% 7.32/2.34 # Condensation successes : 0
% 7.32/2.34 # Termbank termtop insertions : 7941
% 7.32/2.34
% 7.32/2.34 # -------------------------------------------------
% 7.32/2.34 # User time : 0.025 s
% 7.32/2.34 # System time : 0.006 s
% 7.32/2.34 # Total time : 0.031 s
% 7.32/2.34 # ...preprocessing : 0.017 s
% 7.32/2.34 # ...main loop : 0.014 s
% 7.32/2.34 # Maximum resident set size: 7128 pages
% 7.32/2.34
%------------------------------------------------------------------------------