TSTP Solution File: LCL483+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : LCL483+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n012.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:20 EDT 2022
% Result : Theorem 7.25s 2.23s
% Output : CNFRefutation 7.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 10
% Syntax : Number of clauses : 28 ( 18 unt; 0 nHn; 15 RR)
% Number of literals : 38 ( 9 equ; 14 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 8 ( 6 usr; 6 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 26 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_43,plain,
( not(and(X1,not(X2))) = implies(X1,X2)
| ~ op_implies_and ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-n500y_ij/input.p',i_0_43) ).
cnf(i_0_21,plain,
op_implies_and,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-n500y_ij/input.p',i_0_21) ).
cnf(i_0_39,plain,
( modus_tollens
| ~ is_a_theorem(implies(implies(not(esk35_0),not(esk34_0)),implies(esk34_0,esk35_0))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-n500y_ij/input.p',i_0_39) ).
cnf(i_0_19,negated_conjecture,
~ modus_tollens,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-n500y_ij/input.p',i_0_19) ).
cnf(i_0_45,plain,
( not(and(not(X1),not(X2))) = or(X1,X2)
| ~ op_or ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-n500y_ij/input.p',i_0_45) ).
cnf(i_0_22,plain,
op_or,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-n500y_ij/input.p',i_0_22) ).
cnf(i_0_66,plain,
( is_a_theorem(implies(or(X1,X2),or(X2,X1)))
| ~ r3 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-n500y_ij/input.p',i_0_66) ).
cnf(i_0_58,plain,
r3,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-n500y_ij/input.p',i_0_58) ).
cnf(i_0_44,plain,
( or(not(X1),X2) = implies(X1,X2)
| ~ op_implies_or ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-n500y_ij/input.p',i_0_44) ).
cnf(i_0_55,plain,
op_implies_or,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-n500y_ij/input.p',i_0_55) ).
cnf(c_0_77,plain,
( not(and(X1,not(X2))) = implies(X1,X2)
| ~ op_implies_and ),
i_0_43 ).
cnf(c_0_78,plain,
op_implies_and,
i_0_21 ).
cnf(c_0_79,plain,
( modus_tollens
| ~ is_a_theorem(implies(implies(not(esk35_0),not(esk34_0)),implies(esk34_0,esk35_0))) ),
i_0_39 ).
cnf(c_0_80,negated_conjecture,
~ modus_tollens,
i_0_19 ).
cnf(c_0_81,plain,
( not(and(not(X1),not(X2))) = or(X1,X2)
| ~ op_or ),
i_0_45 ).
cnf(c_0_82,plain,
not(and(X1,not(X2))) = implies(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_77,c_0_78])]) ).
cnf(c_0_83,plain,
op_or,
i_0_22 ).
cnf(c_0_84,plain,
( is_a_theorem(implies(or(X1,X2),or(X2,X1)))
| ~ r3 ),
i_0_66 ).
cnf(c_0_85,plain,
r3,
i_0_58 ).
cnf(c_0_86,plain,
( or(not(X1),X2) = implies(X1,X2)
| ~ op_implies_or ),
i_0_44 ).
cnf(c_0_87,plain,
op_implies_or,
i_0_55 ).
cnf(c_0_88,plain,
~ is_a_theorem(implies(implies(not(esk35_0),not(esk34_0)),implies(esk34_0,esk35_0))),
inference(sr,[status(thm)],[c_0_79,c_0_80]) ).
cnf(c_0_89,plain,
implies(not(X1),X2) = or(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_81,c_0_82]),c_0_83])]) ).
cnf(c_0_90,plain,
is_a_theorem(implies(or(X1,X2),or(X2,X1))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_84,c_0_85])]) ).
cnf(c_0_91,plain,
or(not(X1),X2) = implies(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_86,c_0_87])]) ).
cnf(c_0_92,plain,
~ is_a_theorem(implies(or(esk35_0,not(esk34_0)),implies(esk34_0,esk35_0))),
inference(rw,[status(thm)],[c_0_88,c_0_89]) ).
cnf(c_0_93,plain,
is_a_theorem(implies(or(X1,not(X2)),implies(X2,X1))),
inference(spm,[status(thm)],[c_0_90,c_0_91]) ).
cnf(c_0_94,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_92,c_0_93])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : LCL483+1 : TPTP v8.1.0. Released v3.3.0.
% 0.06/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n012.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 : Sun Jul 3 00:57:48 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected SinE mode:
% 0.19/0.45 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.45 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.45 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.45 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.25/2.23 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 7.25/2.23 # Version: 2.1pre011
% 7.25/2.23 # Preprocessing time : 0.010 s
% 7.25/2.23
% 7.25/2.23 # Proof found!
% 7.25/2.23 # SZS status Theorem
% 7.25/2.23 # SZS output start CNFRefutation
% See solution above
% 7.25/2.23 # Proof object total steps : 28
% 7.25/2.23 # Proof object clause steps : 18
% 7.25/2.23 # Proof object formula steps : 10
% 7.25/2.23 # Proof object conjectures : 2
% 7.25/2.23 # Proof object clause conjectures : 1
% 7.25/2.23 # Proof object formula conjectures : 1
% 7.25/2.23 # Proof object initial clauses used : 10
% 7.25/2.23 # Proof object initial formulas used : 10
% 7.25/2.23 # Proof object generating inferences : 1
% 7.25/2.23 # Proof object simplifying inferences : 13
% 7.25/2.23 # Training examples: 0 positive, 0 negative
% 7.25/2.23 # Parsed axioms : 74
% 7.25/2.23 # Removed by relevancy pruning/SinE : 0
% 7.25/2.23 # Initial clauses : 74
% 7.25/2.23 # Removed in clause preprocessing : 0
% 7.25/2.23 # Initial clauses in saturation : 74
% 7.25/2.23 # Processed clauses : 215
% 7.25/2.23 # ...of these trivial : 13
% 7.25/2.23 # ...subsumed : 27
% 7.25/2.23 # ...remaining for further processing : 175
% 7.25/2.23 # Other redundant clauses eliminated : 0
% 7.25/2.23 # Clauses deleted for lack of memory : 0
% 7.25/2.23 # Backward-subsumed : 4
% 7.25/2.23 # Backward-rewritten : 12
% 7.25/2.23 # Generated clauses : 757
% 7.25/2.23 # ...of the previous two non-trivial : 672
% 7.25/2.23 # Contextual simplify-reflections : 2
% 7.25/2.23 # Paramodulations : 757
% 7.25/2.23 # Factorizations : 0
% 7.25/2.23 # Equation resolutions : 0
% 7.25/2.23 # Propositional unsat checks : 0
% 7.25/2.23 # Propositional unsat check successes : 0
% 7.25/2.23 # Current number of processed clauses : 159
% 7.25/2.23 # Positive orientable unit clauses : 42
% 7.25/2.23 # Positive unorientable unit clauses: 0
% 7.25/2.23 # Negative unit clauses : 3
% 7.25/2.23 # Non-unit-clauses : 114
% 7.25/2.23 # Current number of unprocessed clauses: 494
% 7.25/2.23 # ...number of literals in the above : 955
% 7.25/2.23 # Current number of archived formulas : 0
% 7.25/2.23 # Current number of archived clauses : 16
% 7.25/2.23 # Clause-clause subsumption calls (NU) : 2151
% 7.25/2.23 # Rec. Clause-clause subsumption calls : 2063
% 7.25/2.23 # Non-unit clause-clause subsumptions : 30
% 7.25/2.23 # Unit Clause-clause subsumption calls : 136
% 7.25/2.23 # Rewrite failures with RHS unbound : 0
% 7.25/2.23 # BW rewrite match attempts : 52
% 7.25/2.23 # BW rewrite match successes : 11
% 7.25/2.23 # Condensation attempts : 0
% 7.25/2.23 # Condensation successes : 0
% 7.25/2.23 # Termbank termtop insertions : 9747
% 7.25/2.23
% 7.25/2.23 # -------------------------------------------------
% 7.25/2.23 # User time : 0.019 s
% 7.25/2.23 # System time : 0.002 s
% 7.25/2.23 # Total time : 0.021 s
% 7.25/2.23 # ...preprocessing : 0.010 s
% 7.25/2.23 # ...main loop : 0.011 s
% 7.25/2.23 # Maximum resident set size: 7128 pages
% 7.25/2.23
%------------------------------------------------------------------------------