TSTP Solution File: LCL506+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : LCL506+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n011.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 09:26:29 EDT 2022
% Result : Theorem 7.47s 2.25s
% Output : CNFRefutation 7.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 4
% Syntax : Number of clauses : 11 ( 7 unt; 0 nHn; 8 RR)
% Number of literals : 15 ( 0 equ; 7 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 4 ( 3 usr; 3 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 6 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_1,plain,
( and_1
| ~ is_a_theorem(implies(and(esk1_0,esk2_0),esk1_0)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-o04m_5fx/input.p',i_0_1) ).
cnf(i_0_19,negated_conjecture,
~ and_1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-o04m_5fx/input.p',i_0_19) ).
cnf(i_0_32,plain,
( is_a_theorem(implies(and(X1,X2),X1))
| ~ kn2 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-o04m_5fx/input.p',i_0_32) ).
cnf(i_0_63,plain,
kn2,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-o04m_5fx/input.p',i_0_63) ).
cnf(c_0_68,plain,
( and_1
| ~ is_a_theorem(implies(and(esk1_0,esk2_0),esk1_0)) ),
i_0_1 ).
cnf(c_0_69,negated_conjecture,
~ and_1,
i_0_19 ).
cnf(c_0_70,plain,
( is_a_theorem(implies(and(X1,X2),X1))
| ~ kn2 ),
i_0_32 ).
cnf(c_0_71,plain,
kn2,
i_0_63 ).
cnf(c_0_72,plain,
~ is_a_theorem(implies(and(esk1_0,esk2_0),esk1_0)),
inference(sr,[status(thm)],[c_0_68,c_0_69]) ).
cnf(c_0_73,plain,
is_a_theorem(implies(and(X1,X2),X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_70,c_0_71])]) ).
cnf(c_0_74,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_72,c_0_73])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL506+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.14/0.34 % Computer : n011.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Mon Jul 4 21:33:38 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.20/0.45 # ENIGMATIC: Selected SinE mode:
% 0.20/0.46 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.46 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.20/0.46 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.20/0.46 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.47/2.25 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 7.47/2.25 # Version: 2.1pre011
% 7.47/2.25 # Preprocessing time : 0.011 s
% 7.47/2.25
% 7.47/2.25 # Proof found!
% 7.47/2.25 # SZS status Theorem
% 7.47/2.25 # SZS output start CNFRefutation
% See solution above
% 7.47/2.25 # Proof object total steps : 11
% 7.47/2.25 # Proof object clause steps : 7
% 7.47/2.25 # Proof object formula steps : 4
% 7.47/2.25 # Proof object conjectures : 2
% 7.47/2.25 # Proof object clause conjectures : 1
% 7.47/2.25 # Proof object formula conjectures : 1
% 7.47/2.25 # Proof object initial clauses used : 4
% 7.47/2.25 # Proof object initial formulas used : 4
% 7.47/2.25 # Proof object generating inferences : 0
% 7.47/2.25 # Proof object simplifying inferences : 5
% 7.47/2.25 # Training examples: 0 positive, 0 negative
% 7.47/2.25 # Parsed axioms : 72
% 7.47/2.25 # Removed by relevancy pruning/SinE : 0
% 7.47/2.25 # Initial clauses : 72
% 7.47/2.25 # Removed in clause preprocessing : 0
% 7.47/2.25 # Initial clauses in saturation : 72
% 7.47/2.25 # Processed clauses : 50
% 7.47/2.25 # ...of these trivial : 9
% 7.47/2.25 # ...subsumed : 1
% 7.47/2.25 # ...remaining for further processing : 40
% 7.47/2.25 # Other redundant clauses eliminated : 0
% 7.47/2.25 # Clauses deleted for lack of memory : 0
% 7.47/2.25 # Backward-subsumed : 0
% 7.47/2.25 # Backward-rewritten : 3
% 7.47/2.25 # Generated clauses : 45
% 7.47/2.25 # ...of the previous two non-trivial : 38
% 7.47/2.25 # Contextual simplify-reflections : 0
% 7.47/2.25 # Paramodulations : 45
% 7.47/2.25 # Factorizations : 0
% 7.47/2.25 # Equation resolutions : 0
% 7.47/2.25 # Propositional unsat checks : 0
% 7.47/2.25 # Propositional unsat check successes : 0
% 7.47/2.25 # Current number of processed clauses : 37
% 7.47/2.25 # Positive orientable unit clauses : 13
% 7.47/2.25 # Positive unorientable unit clauses: 0
% 7.47/2.25 # Negative unit clauses : 1
% 7.47/2.25 # Non-unit-clauses : 23
% 7.47/2.25 # Current number of unprocessed clauses: 60
% 7.47/2.25 # ...number of literals in the above : 127
% 7.47/2.25 # Current number of archived formulas : 0
% 7.47/2.25 # Current number of archived clauses : 3
% 7.47/2.25 # Clause-clause subsumption calls (NU) : 15
% 7.47/2.25 # Rec. Clause-clause subsumption calls : 15
% 7.47/2.25 # Non-unit clause-clause subsumptions : 0
% 7.47/2.25 # Unit Clause-clause subsumption calls : 6
% 7.47/2.25 # Rewrite failures with RHS unbound : 0
% 7.47/2.25 # BW rewrite match attempts : 4
% 7.47/2.25 # BW rewrite match successes : 2
% 7.47/2.25 # Condensation attempts : 0
% 7.47/2.25 # Condensation successes : 0
% 7.47/2.25 # Termbank termtop insertions : 1684
% 7.47/2.25
% 7.47/2.25 # -------------------------------------------------
% 7.47/2.25 # User time : 0.007 s
% 7.47/2.25 # System time : 0.005 s
% 7.47/2.25 # Total time : 0.012 s
% 7.47/2.25 # ...preprocessing : 0.011 s
% 7.47/2.25 # ...main loop : 0.001 s
% 7.47/2.25 # Maximum resident set size: 7132 pages
% 7.47/2.25
%------------------------------------------------------------------------------