TSTP Solution File: LCL455+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : LCL455+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n007.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:10 EDT 2022
% Result : Theorem 7.59s 2.45s
% Output : CNFRefutation 7.59s
% 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_71,plain,
( r2
| ~ is_a_theorem(implies(esk45_0,or(esk44_0,esk45_0))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-j62297xx/input.p',i_0_71) ).
cnf(i_0_68,negated_conjecture,
~ r2,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-j62297xx/input.p',i_0_68) ).
cnf(i_0_62,plain,
( is_a_theorem(implies(X1,or(X2,X1)))
| ~ or_2 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-j62297xx/input.p',i_0_62) ).
cnf(i_0_34,plain,
or_2,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-j62297xx/input.p',i_0_34) ).
cnf(c_0_76,plain,
( r2
| ~ is_a_theorem(implies(esk45_0,or(esk44_0,esk45_0))) ),
i_0_71 ).
cnf(c_0_77,negated_conjecture,
~ r2,
i_0_68 ).
cnf(c_0_78,plain,
( is_a_theorem(implies(X1,or(X2,X1)))
| ~ or_2 ),
i_0_62 ).
cnf(c_0_79,plain,
or_2,
i_0_34 ).
cnf(c_0_80,plain,
~ is_a_theorem(implies(esk45_0,or(esk44_0,esk45_0))),
inference(sr,[status(thm)],[c_0_76,c_0_77]) ).
cnf(c_0_81,plain,
is_a_theorem(implies(X1,or(X2,X1))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_78,c_0_79])]) ).
cnf(c_0_82,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_80,c_0_81])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL455+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n007.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 : Sat Jul 2 23:23:12 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected SinE mode:
% 0.18/0.45 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.45 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.18/0.45 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.18/0.45 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.59/2.45 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 7.59/2.45 # Version: 2.1pre011
% 7.59/2.45 # Preprocessing time : 0.011 s
% 7.59/2.45
% 7.59/2.45 # Proof found!
% 7.59/2.45 # SZS status Theorem
% 7.59/2.45 # SZS output start CNFRefutation
% See solution above
% 7.59/2.45 # Proof object total steps : 11
% 7.59/2.45 # Proof object clause steps : 7
% 7.59/2.45 # Proof object formula steps : 4
% 7.59/2.45 # Proof object conjectures : 2
% 7.59/2.45 # Proof object clause conjectures : 1
% 7.59/2.45 # Proof object formula conjectures : 1
% 7.59/2.45 # Proof object initial clauses used : 4
% 7.59/2.45 # Proof object initial formulas used : 4
% 7.59/2.45 # Proof object generating inferences : 0
% 7.59/2.45 # Proof object simplifying inferences : 5
% 7.59/2.45 # Training examples: 0 positive, 0 negative
% 7.59/2.45 # Parsed axioms : 82
% 7.59/2.45 # Removed by relevancy pruning/SinE : 0
% 7.59/2.45 # Initial clauses : 82
% 7.59/2.45 # Removed in clause preprocessing : 0
% 7.59/2.45 # Initial clauses in saturation : 82
% 7.59/2.45 # Processed clauses : 45
% 7.59/2.45 # ...of these trivial : 10
% 7.59/2.45 # ...subsumed : 1
% 7.59/2.45 # ...remaining for further processing : 34
% 7.59/2.45 # Other redundant clauses eliminated : 0
% 7.59/2.45 # Clauses deleted for lack of memory : 0
% 7.59/2.45 # Backward-subsumed : 0
% 7.59/2.45 # Backward-rewritten : 3
% 7.59/2.45 # Generated clauses : 9
% 7.59/2.45 # ...of the previous two non-trivial : 8
% 7.59/2.45 # Contextual simplify-reflections : 0
% 7.59/2.45 # Paramodulations : 9
% 7.59/2.45 # Factorizations : 0
% 7.59/2.45 # Equation resolutions : 0
% 7.59/2.45 # Propositional unsat checks : 0
% 7.59/2.45 # Propositional unsat check successes : 0
% 7.59/2.45 # Current number of processed clauses : 31
% 7.59/2.45 # Positive orientable unit clauses : 25
% 7.59/2.45 # Positive unorientable unit clauses: 0
% 7.59/2.45 # Negative unit clauses : 1
% 7.59/2.45 # Non-unit-clauses : 5
% 7.59/2.45 # Current number of unprocessed clauses: 45
% 7.59/2.45 # ...number of literals in the above : 84
% 7.59/2.45 # Current number of archived formulas : 0
% 7.59/2.45 # Current number of archived clauses : 3
% 7.59/2.45 # Clause-clause subsumption calls (NU) : 0
% 7.59/2.45 # Rec. Clause-clause subsumption calls : 0
% 7.59/2.45 # Non-unit clause-clause subsumptions : 0
% 7.59/2.45 # Unit Clause-clause subsumption calls : 11
% 7.59/2.45 # Rewrite failures with RHS unbound : 0
% 7.59/2.45 # BW rewrite match attempts : 2
% 7.59/2.45 # BW rewrite match successes : 2
% 7.59/2.45 # Condensation attempts : 0
% 7.59/2.45 # Condensation successes : 0
% 7.59/2.45 # Termbank termtop insertions : 1401
% 7.59/2.45
% 7.59/2.45 # -------------------------------------------------
% 7.59/2.45 # User time : 0.007 s
% 7.59/2.45 # System time : 0.005 s
% 7.59/2.45 # Total time : 0.012 s
% 7.59/2.45 # ...preprocessing : 0.011 s
% 7.59/2.45 # ...main loop : 0.001 s
% 7.59/2.45 # Maximum resident set size: 7128 pages
% 7.59/2.45
%------------------------------------------------------------------------------