TSTP Solution File: LCL512+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : LCL512+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n026.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:31 EDT 2022
% Result : Theorem 8.22s 2.54s
% Output : CNFRefutation 8.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 6
% Syntax : Number of clauses : 17 ( 11 unt; 0 nHn; 10 RR)
% Number of literals : 23 ( 3 equ; 9 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 6 ( 4 usr; 4 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 14 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_32,plain,
( is_a_theorem(implies(and(X1,X2),X1))
| ~ kn2 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-r2cdng9u/input.p',i_0_32) ).
cnf(i_0_63,plain,
kn2,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-r2cdng9u/input.p',i_0_63) ).
cnf(i_0_42,plain,
( and(implies(X1,X2),implies(X2,X1)) = equiv(X1,X2)
| ~ op_equiv ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-r2cdng9u/input.p',i_0_42) ).
cnf(i_0_20,plain,
op_equiv,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-r2cdng9u/input.p',i_0_20) ).
cnf(i_0_13,plain,
( equivalence_1
| ~ is_a_theorem(implies(equiv(esk13_0,esk14_0),implies(esk13_0,esk14_0))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-r2cdng9u/input.p',i_0_13) ).
cnf(i_0_19,negated_conjecture,
~ equivalence_1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-r2cdng9u/input.p',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,
( and(implies(X1,X2),implies(X2,X1)) = equiv(X1,X2)
| ~ op_equiv ),
i_0_42 ).
cnf(c_0_73,plain,
op_equiv,
i_0_20 ).
cnf(c_0_74,plain,
( equivalence_1
| ~ is_a_theorem(implies(equiv(esk13_0,esk14_0),implies(esk13_0,esk14_0))) ),
i_0_13 ).
cnf(c_0_75,negated_conjecture,
~ equivalence_1,
i_0_19 ).
cnf(c_0_76,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_77,plain,
and(implies(X1,X2),implies(X2,X1)) = equiv(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_72,c_0_73])]) ).
cnf(c_0_78,plain,
~ is_a_theorem(implies(equiv(esk13_0,esk14_0),implies(esk13_0,esk14_0))),
inference(sr,[status(thm)],[c_0_74,c_0_75]) ).
cnf(c_0_79,plain,
is_a_theorem(implies(equiv(X1,X2),implies(X1,X2))),
inference(spm,[status(thm)],[c_0_76,c_0_77]) ).
cnf(c_0_80,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_78,c_0_79])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : LCL512+1 : TPTP v8.1.0. Released v3.3.0.
% 0.11/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n026.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 : Mon Jul 4 09:36:53 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
% 8.22/2.54 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 8.22/2.54 # Version: 2.1pre011
% 8.22/2.54 # Preprocessing time : 0.020 s
% 8.22/2.54
% 8.22/2.54 # Proof found!
% 8.22/2.54 # SZS status Theorem
% 8.22/2.54 # SZS output start CNFRefutation
% See solution above
% 8.22/2.54 # Proof object total steps : 17
% 8.22/2.54 # Proof object clause steps : 11
% 8.22/2.54 # Proof object formula steps : 6
% 8.22/2.54 # Proof object conjectures : 2
% 8.22/2.54 # Proof object clause conjectures : 1
% 8.22/2.54 # Proof object formula conjectures : 1
% 8.22/2.54 # Proof object initial clauses used : 6
% 8.22/2.54 # Proof object initial formulas used : 6
% 8.22/2.54 # Proof object generating inferences : 1
% 8.22/2.54 # Proof object simplifying inferences : 7
% 8.22/2.54 # Training examples: 0 positive, 0 negative
% 8.22/2.54 # Parsed axioms : 72
% 8.22/2.54 # Removed by relevancy pruning/SinE : 0
% 8.22/2.54 # Initial clauses : 72
% 8.22/2.54 # Removed in clause preprocessing : 0
% 8.22/2.54 # Initial clauses in saturation : 72
% 8.22/2.54 # Processed clauses : 197
% 8.22/2.54 # ...of these trivial : 11
% 8.22/2.54 # ...subsumed : 31
% 8.22/2.54 # ...remaining for further processing : 155
% 8.22/2.54 # Other redundant clauses eliminated : 0
% 8.22/2.54 # Clauses deleted for lack of memory : 0
% 8.22/2.54 # Backward-subsumed : 0
% 8.22/2.54 # Backward-rewritten : 4
% 8.22/2.54 # Generated clauses : 713
% 8.22/2.54 # ...of the previous two non-trivial : 653
% 8.22/2.54 # Contextual simplify-reflections : 35
% 8.22/2.54 # Paramodulations : 713
% 8.22/2.54 # Factorizations : 0
% 8.22/2.54 # Equation resolutions : 0
% 8.22/2.54 # Propositional unsat checks : 0
% 8.22/2.54 # Propositional unsat check successes : 0
% 8.22/2.54 # Current number of processed clauses : 151
% 8.22/2.54 # Positive orientable unit clauses : 22
% 8.22/2.54 # Positive unorientable unit clauses: 0
% 8.22/2.54 # Negative unit clauses : 1
% 8.22/2.54 # Non-unit-clauses : 128
% 8.22/2.54 # Current number of unprocessed clauses: 528
% 8.22/2.54 # ...number of literals in the above : 1510
% 8.22/2.54 # Current number of archived formulas : 0
% 8.22/2.54 # Current number of archived clauses : 4
% 8.22/2.54 # Clause-clause subsumption calls (NU) : 3393
% 8.22/2.54 # Rec. Clause-clause subsumption calls : 2829
% 8.22/2.54 # Non-unit clause-clause subsumptions : 65
% 8.22/2.54 # Unit Clause-clause subsumption calls : 82
% 8.22/2.54 # Rewrite failures with RHS unbound : 0
% 8.22/2.54 # BW rewrite match attempts : 7
% 8.22/2.54 # BW rewrite match successes : 3
% 8.22/2.54 # Condensation attempts : 0
% 8.22/2.54 # Condensation successes : 0
% 8.22/2.54 # Termbank termtop insertions : 8963
% 8.22/2.54
% 8.22/2.54 # -------------------------------------------------
% 8.22/2.54 # User time : 0.029 s
% 8.22/2.54 # System time : 0.005 s
% 8.22/2.54 # Total time : 0.035 s
% 8.22/2.54 # ...preprocessing : 0.020 s
% 8.22/2.54 # ...main loop : 0.015 s
% 8.22/2.54 # Maximum resident set size: 7128 pages
% 8.22/2.54
%------------------------------------------------------------------------------