TSTP Solution File: REL049+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : REL049+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n022.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 : Mon Jul 18 19:13:56 EDT 2022
% Result : Theorem 7.10s 2.30s
% Output : CNFRefutation 7.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of clauses : 15 ( 15 unt; 0 nHn; 10 RR)
% Number of literals : 15 ( 14 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 11 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_12,negated_conjecture,
join(esk1_0,esk2_0) = esk2_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-253lcmcg/input.p',i_0_12) ).
cnf(i_0_13,plain,
join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-253lcmcg/input.p',i_0_13) ).
cnf(i_0_10,negated_conjecture,
join(join(esk1_0,esk3_0),esk2_0) != esk2_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-253lcmcg/input.p',i_0_10) ).
cnf(i_0_14,plain,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-253lcmcg/input.p',i_0_14) ).
cnf(i_0_11,negated_conjecture,
join(esk3_0,esk2_0) = esk2_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-253lcmcg/input.p',i_0_11) ).
cnf(c_0_20,negated_conjecture,
join(esk1_0,esk2_0) = esk2_0,
i_0_12 ).
cnf(c_0_21,plain,
join(X1,X2) = join(X2,X1),
i_0_13 ).
cnf(c_0_22,negated_conjecture,
join(join(esk1_0,esk3_0),esk2_0) != esk2_0,
i_0_10 ).
cnf(c_0_23,plain,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
i_0_14 ).
cnf(c_0_24,negated_conjecture,
join(esk2_0,esk1_0) = esk2_0,
inference(rw,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,negated_conjecture,
join(esk3_0,esk2_0) = esk2_0,
i_0_11 ).
cnf(c_0_26,negated_conjecture,
join(esk2_0,join(esk1_0,esk3_0)) != esk2_0,
inference(rw,[status(thm)],[c_0_22,c_0_21]) ).
cnf(c_0_27,plain,
join(esk2_0,join(esk1_0,X1)) = join(esk2_0,X1),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_28,negated_conjecture,
join(esk2_0,esk3_0) = esk2_0,
inference(rw,[status(thm)],[c_0_25,c_0_21]) ).
cnf(c_0_29,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_27]),c_0_28])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : REL049+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.33 % Computer : n022.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Fri Jul 8 15:39:27 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected SinE mode:
% 0.19/0.45 # Parsing /export/starexec/sandbox2/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.10/2.30 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 7.10/2.30 # Version: 2.1pre011
% 7.10/2.30 # Preprocessing time : 0.010 s
% 7.10/2.30
% 7.10/2.30 # Proof found!
% 7.10/2.30 # SZS status Theorem
% 7.10/2.30 # SZS output start CNFRefutation
% See solution above
% 7.10/2.30 # Proof object total steps : 15
% 7.10/2.30 # Proof object clause steps : 10
% 7.10/2.30 # Proof object formula steps : 5
% 7.10/2.30 # Proof object conjectures : 10
% 7.10/2.30 # Proof object clause conjectures : 7
% 7.10/2.30 # Proof object formula conjectures : 3
% 7.10/2.30 # Proof object initial clauses used : 5
% 7.10/2.30 # Proof object initial formulas used : 5
% 7.10/2.30 # Proof object generating inferences : 1
% 7.10/2.30 # Proof object simplifying inferences : 6
% 7.10/2.30 # Training examples: 0 positive, 0 negative
% 7.10/2.30 # Parsed axioms : 15
% 7.10/2.30 # Removed by relevancy pruning/SinE : 0
% 7.10/2.30 # Initial clauses : 15
% 7.10/2.30 # Removed in clause preprocessing : 0
% 7.10/2.30 # Initial clauses in saturation : 15
% 7.10/2.30 # Processed clauses : 21
% 7.10/2.30 # ...of these trivial : 0
% 7.10/2.30 # ...subsumed : 0
% 7.10/2.30 # ...remaining for further processing : 21
% 7.10/2.30 # Other redundant clauses eliminated : 0
% 7.10/2.30 # Clauses deleted for lack of memory : 0
% 7.10/2.30 # Backward-subsumed : 0
% 7.10/2.30 # Backward-rewritten : 4
% 7.10/2.30 # Generated clauses : 58
% 7.10/2.30 # ...of the previous two non-trivial : 51
% 7.10/2.30 # Contextual simplify-reflections : 0
% 7.10/2.30 # Paramodulations : 58
% 7.10/2.30 # Factorizations : 0
% 7.10/2.30 # Equation resolutions : 0
% 7.10/2.30 # Propositional unsat checks : 0
% 7.10/2.30 # Propositional unsat check successes : 0
% 7.10/2.30 # Current number of processed clauses : 17
% 7.10/2.30 # Positive orientable unit clauses : 16
% 7.10/2.30 # Positive unorientable unit clauses: 1
% 7.10/2.30 # Negative unit clauses : 0
% 7.10/2.30 # Non-unit-clauses : 0
% 7.10/2.30 # Current number of unprocessed clauses: 45
% 7.10/2.30 # ...number of literals in the above : 45
% 7.10/2.30 # Current number of archived formulas : 0
% 7.10/2.30 # Current number of archived clauses : 4
% 7.10/2.30 # Clause-clause subsumption calls (NU) : 0
% 7.10/2.30 # Rec. Clause-clause subsumption calls : 0
% 7.10/2.30 # Non-unit clause-clause subsumptions : 0
% 7.10/2.30 # Unit Clause-clause subsumption calls : 0
% 7.10/2.30 # Rewrite failures with RHS unbound : 0
% 7.10/2.30 # BW rewrite match attempts : 11
% 7.10/2.30 # BW rewrite match successes : 11
% 7.10/2.30 # Condensation attempts : 0
% 7.10/2.30 # Condensation successes : 0
% 7.10/2.30 # Termbank termtop insertions : 761
% 7.10/2.30
% 7.10/2.30 # -------------------------------------------------
% 7.10/2.30 # User time : 0.005 s
% 7.10/2.30 # System time : 0.005 s
% 7.10/2.30 # Total time : 0.011 s
% 7.10/2.30 # ...preprocessing : 0.010 s
% 7.10/2.30 # ...main loop : 0.001 s
% 7.10/2.30 # Maximum resident set size: 7132 pages
% 7.10/2.30
%------------------------------------------------------------------------------