%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GEO085+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n027.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 : Sat Jul 16 03:43:14 EDT 2022
% Result : Theorem 7.48s 2.39s
% Output : CNFRefutation 7.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of clauses : 20 ( 6 unt; 2 nHn; 18 RR)
% Number of literals : 36 ( 7 equ; 19 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-2 aty)
% Number of variables : 23 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_44,negated_conjecture,
( X1 = X2
| ~ end_point(X2,esk14_0)
| ~ end_point(X1,esk14_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-t1f74z73/input.p',i_0_44) ).
cnf(i_0_13,plain,
( closed(X1)
| end_point(esk7_1(X1),X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-t1f74z73/input.p',i_0_13) ).
cnf(i_0_14,plain,
( ~ closed(X1)
| ~ end_point(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-t1f74z73/input.p',i_0_14) ).
cnf(i_0_34,plain,
( end_point(esk11_1(X1),X1)
| ~ open(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-t1f74z73/input.p',i_0_34) ).
cnf(i_0_45,negated_conjecture,
open(esk14_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-t1f74z73/input.p',i_0_45) ).
cnf(i_0_8,plain,
( end_point(esk4_2(X1,X2),X1)
| ~ end_point(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-t1f74z73/input.p',i_0_8) ).
cnf(i_0_7,plain,
( esk4_2(X1,X2) != X2
| ~ end_point(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-t1f74z73/input.p',i_0_7) ).
cnf(c_0_53,negated_conjecture,
( X1 = X2
| ~ end_point(X2,esk14_0)
| ~ end_point(X1,esk14_0) ),
i_0_44 ).
cnf(c_0_54,plain,
( closed(X1)
| end_point(esk7_1(X1),X1) ),
i_0_13 ).
cnf(c_0_55,plain,
( ~ closed(X1)
| ~ end_point(X2,X1) ),
i_0_14 ).
cnf(c_0_56,plain,
( X1 = esk7_1(esk14_0)
| ~ end_point(X1,esk14_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_55]) ).
cnf(c_0_57,plain,
( end_point(esk11_1(X1),X1)
| ~ open(X1) ),
i_0_34 ).
cnf(c_0_58,negated_conjecture,
open(esk14_0),
i_0_45 ).
cnf(c_0_59,plain,
( end_point(esk4_2(X1,X2),X1)
| ~ end_point(X2,X1) ),
i_0_8 ).
cnf(c_0_60,plain,
esk11_1(esk14_0) = esk7_1(esk14_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_58])]) ).
cnf(c_0_61,plain,
( esk4_2(X1,X2) != X2
| ~ end_point(X2,X1) ),
i_0_7 ).
cnf(c_0_62,plain,
( esk4_2(esk14_0,X1) = esk7_1(esk14_0)
| ~ end_point(X1,esk14_0) ),
inference(spm,[status(thm)],[c_0_56,c_0_59]) ).
cnf(c_0_63,plain,
end_point(esk7_1(esk14_0),esk14_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_60]),c_0_58])]) ).
cnf(c_0_64,plain,
~ end_point(X1,esk14_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_56]) ).
cnf(c_0_65,plain,
$false,
inference(sr,[status(thm)],[c_0_63,c_0_64]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : GEO085+1 : TPTP v8.1.0. Released v2.4.0.
% 0.06/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n027.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 : Sat Jun 18 10:18:39 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected SinE mode:
% 0.19/0.46 # Parsing /export/starexec/sandbox2/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
% 7.48/2.39 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 7.48/2.39 # Version: 2.1pre011
% 7.48/2.39 # Preprocessing time : 0.010 s
% 7.48/2.39
% 7.48/2.39 # Proof found!
% 7.48/2.39 # SZS status Theorem
% 7.48/2.39 # SZS output start CNFRefutation
% See solution above
% 7.48/2.39 # Proof object total steps : 20
% 7.48/2.39 # Proof object clause steps : 13
% 7.48/2.39 # Proof object formula steps : 7
% 7.48/2.39 # Proof object conjectures : 4
% 7.48/2.39 # Proof object clause conjectures : 2
% 7.48/2.39 # Proof object formula conjectures : 2
% 7.48/2.39 # Proof object initial clauses used : 7
% 7.48/2.39 # Proof object initial formulas used : 7
% 7.48/2.39 # Proof object generating inferences : 5
% 7.48/2.39 # Proof object simplifying inferences : 7
% 7.48/2.39 # Training examples: 0 positive, 0 negative
% 7.48/2.39 # Parsed axioms : 45
% 7.48/2.39 # Removed by relevancy pruning/SinE : 0
% 7.48/2.39 # Initial clauses : 45
% 7.48/2.39 # Removed in clause preprocessing : 0
% 7.48/2.39 # Initial clauses in saturation : 45
% 7.48/2.39 # Processed clauses : 70
% 7.48/2.39 # ...of these trivial : 2
% 7.48/2.39 # ...subsumed : 5
% 7.48/2.39 # ...remaining for further processing : 63
% 7.48/2.39 # Other redundant clauses eliminated : 3
% 7.48/2.39 # Clauses deleted for lack of memory : 0
% 7.48/2.39 # Backward-subsumed : 2
% 7.48/2.39 # Backward-rewritten : 1
% 7.48/2.39 # Generated clauses : 98
% 7.48/2.39 # ...of the previous two non-trivial : 78
% 7.48/2.39 # Contextual simplify-reflections : 2
% 7.48/2.39 # Paramodulations : 83
% 7.48/2.39 # Factorizations : 8
% 7.48/2.39 # Equation resolutions : 6
% 7.48/2.39 # Propositional unsat checks : 0
% 7.48/2.39 # Propositional unsat check successes : 0
% 7.48/2.39 # Current number of processed clauses : 59
% 7.48/2.39 # Positive orientable unit clauses : 6
% 7.48/2.39 # Positive unorientable unit clauses: 0
% 7.48/2.39 # Negative unit clauses : 3
% 7.48/2.39 # Non-unit-clauses : 50
% 7.48/2.39 # Current number of unprocessed clauses: 48
% 7.48/2.39 # ...number of literals in the above : 255
% 7.48/2.39 # Current number of archived formulas : 0
% 7.48/2.39 # Current number of archived clauses : 4
% 7.48/2.39 # Clause-clause subsumption calls (NU) : 340
% 7.48/2.39 # Rec. Clause-clause subsumption calls : 151
% 7.48/2.39 # Non-unit clause-clause subsumptions : 8
% 7.48/2.39 # Unit Clause-clause subsumption calls : 115
% 7.48/2.39 # Rewrite failures with RHS unbound : 0
% 7.48/2.39 # BW rewrite match attempts : 14
% 7.48/2.39 # BW rewrite match successes : 1
% 7.48/2.39 # Condensation attempts : 0
% 7.48/2.39 # Condensation successes : 0
% 7.48/2.39 # Termbank termtop insertions : 2316
% 7.48/2.39
% 7.48/2.39 # -------------------------------------------------
% 7.48/2.39 # User time : 0.010 s
% 7.48/2.39 # System time : 0.002 s
% 7.48/2.39 # Total time : 0.012 s
% 7.48/2.39 # ...preprocessing : 0.010 s
% 7.48/2.39 # ...main loop : 0.002 s
% 7.48/2.39 # Maximum resident set size: 7128 pages
% 7.48/2.39
%------------------------------------------------------------------------------