TSTP Solution File: REL003+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : REL003+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n023.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:12:48 EDT 2022
% Result : Theorem 7.57s 2.42s
% Output : CNFRefutation 7.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of clauses : 14 ( 8 unt; 3 nHn; 8 RR)
% Number of literals : 20 ( 19 equ; 6 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 10 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_13,negated_conjecture,
( join(esk1_0,esk2_0) = esk2_0
| join(converse(esk1_0),converse(esk2_0)) = converse(esk2_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-wqnv75e7/input.p',i_0_13) ).
cnf(i_0_14,plain,
join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-wqnv75e7/input.p',i_0_14) ).
cnf(i_0_4,plain,
join(converse(X1),converse(X2)) = converse(join(X1,X2)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-wqnv75e7/input.p',i_0_4) ).
cnf(i_0_10,negated_conjecture,
( join(esk1_0,esk2_0) != esk2_0
| join(converse(esk1_0),converse(esk2_0)) != converse(esk2_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-wqnv75e7/input.p',i_0_10) ).
cnf(i_0_6,plain,
converse(converse(X1)) = X1,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-wqnv75e7/input.p',i_0_6) ).
cnf(c_0_20,negated_conjecture,
( join(esk1_0,esk2_0) = esk2_0
| join(converse(esk1_0),converse(esk2_0)) = converse(esk2_0) ),
i_0_13 ).
cnf(c_0_21,plain,
join(X1,X2) = join(X2,X1),
i_0_14 ).
cnf(c_0_22,plain,
join(converse(X1),converse(X2)) = converse(join(X1,X2)),
i_0_4 ).
cnf(c_0_23,negated_conjecture,
( join(esk1_0,esk2_0) != esk2_0
| join(converse(esk1_0),converse(esk2_0)) != converse(esk2_0) ),
i_0_10 ).
cnf(c_0_24,plain,
converse(converse(X1)) = X1,
i_0_6 ).
cnf(c_0_25,negated_conjecture,
( converse(join(esk2_0,esk1_0)) = converse(esk2_0)
| join(esk2_0,esk1_0) = esk2_0 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_21]),c_0_21]),c_0_22]) ).
cnf(c_0_26,negated_conjecture,
( converse(join(esk2_0,esk1_0)) != converse(esk2_0)
| join(esk2_0,esk1_0) != esk2_0 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_21]),c_0_21]),c_0_22]) ).
cnf(c_0_27,plain,
join(esk2_0,esk1_0) = esk2_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_24])]) ).
cnf(c_0_28,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_27]),c_0_27])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : REL003+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n023.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.34 % DateTime : Fri Jul 8 13:39:57 EDT 2022
% 0.12/0.34 % 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.57/2.42 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN:
% 7.57/2.42 # Version: 2.1pre011
% 7.57/2.42 # Preprocessing time : 0.013 s
% 7.57/2.42
% 7.57/2.42 # Proof found!
% 7.57/2.42 # SZS status Theorem
% 7.57/2.42 # SZS output start CNFRefutation
% See solution above
% 7.57/2.42 # Proof object total steps : 14
% 7.57/2.42 # Proof object clause steps : 9
% 7.57/2.42 # Proof object formula steps : 5
% 7.57/2.42 # Proof object conjectures : 7
% 7.57/2.42 # Proof object clause conjectures : 5
% 7.57/2.42 # Proof object formula conjectures : 2
% 7.57/2.42 # Proof object initial clauses used : 5
% 7.57/2.42 # Proof object initial formulas used : 5
% 7.57/2.42 # Proof object generating inferences : 1
% 7.57/2.42 # Proof object simplifying inferences : 11
% 7.57/2.42 # Training examples: 0 positive, 0 negative
% 7.57/2.42 # Parsed axioms : 14
% 7.57/2.42 # Removed by relevancy pruning/SinE : 0
% 7.57/2.42 # Initial clauses : 14
% 7.57/2.42 # Removed in clause preprocessing : 0
% 7.57/2.42 # Initial clauses in saturation : 14
% 7.57/2.42 # Processed clauses : 21
% 7.57/2.42 # ...of these trivial : 0
% 7.57/2.42 # ...subsumed : 0
% 7.57/2.42 # ...remaining for further processing : 21
% 7.57/2.42 # Other redundant clauses eliminated : 0
% 7.57/2.42 # Clauses deleted for lack of memory : 0
% 7.57/2.42 # Backward-subsumed : 0
% 7.57/2.42 # Backward-rewritten : 4
% 7.57/2.42 # Generated clauses : 67
% 7.57/2.42 # ...of the previous two non-trivial : 56
% 7.57/2.42 # Contextual simplify-reflections : 0
% 7.57/2.42 # Paramodulations : 67
% 7.57/2.42 # Factorizations : 0
% 7.57/2.42 # Equation resolutions : 0
% 7.57/2.42 # Propositional unsat checks : 0
% 7.57/2.42 # Propositional unsat check successes : 0
% 7.57/2.42 # Current number of processed clauses : 17
% 7.57/2.42 # Positive orientable unit clauses : 16
% 7.57/2.42 # Positive unorientable unit clauses: 1
% 7.57/2.42 # Negative unit clauses : 0
% 7.57/2.42 # Non-unit-clauses : 0
% 7.57/2.42 # Current number of unprocessed clauses: 44
% 7.57/2.42 # ...number of literals in the above : 44
% 7.57/2.42 # Current number of archived formulas : 0
% 7.57/2.42 # Current number of archived clauses : 4
% 7.57/2.42 # Clause-clause subsumption calls (NU) : 0
% 7.57/2.42 # Rec. Clause-clause subsumption calls : 0
% 7.57/2.42 # Non-unit clause-clause subsumptions : 0
% 7.57/2.42 # Unit Clause-clause subsumption calls : 1
% 7.57/2.42 # Rewrite failures with RHS unbound : 0
% 7.57/2.42 # BW rewrite match attempts : 7
% 7.57/2.42 # BW rewrite match successes : 7
% 7.57/2.42 # Condensation attempts : 0
% 7.57/2.42 # Condensation successes : 0
% 7.57/2.42 # Termbank termtop insertions : 916
% 7.57/2.42
% 7.57/2.42 # -------------------------------------------------
% 7.57/2.42 # User time : 0.010 s
% 7.57/2.42 # System time : 0.004 s
% 7.57/2.42 # Total time : 0.015 s
% 7.57/2.42 # ...preprocessing : 0.013 s
% 7.57/2.42 # ...main loop : 0.002 s
% 7.57/2.42 # Maximum resident set size: 7136 pages
% 7.57/2.42
%------------------------------------------------------------------------------