TSTP Solution File: GEO086+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GEO086+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n007.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:15 EDT 2022
% Result : Theorem 8.51s 2.52s
% Output : CNFRefutation 8.51s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 4
% Syntax : Number of clauses : 10 ( 8 unt; 2 nHn; 10 RR)
% Number of literals : 14 ( 3 equ; 4 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 4 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_1,plain,
( X1 = X2
| open(X1)
| ~ part_of(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-rufhwaro/input.p',i_0_1) ).
cnf(i_0_45,negated_conjecture,
part_of(esk15_0,esk14_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-rufhwaro/input.p',i_0_45) ).
cnf(i_0_44,negated_conjecture,
~ open(esk15_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-rufhwaro/input.p',i_0_44) ).
cnf(i_0_46,negated_conjecture,
open(esk14_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-rufhwaro/input.p',i_0_46) ).
cnf(c_0_51,plain,
( X1 = X2
| open(X1)
| ~ part_of(X1,X2) ),
i_0_1 ).
cnf(c_0_52,negated_conjecture,
part_of(esk15_0,esk14_0),
i_0_45 ).
cnf(c_0_53,negated_conjecture,
~ open(esk15_0),
i_0_44 ).
cnf(c_0_54,negated_conjecture,
open(esk14_0),
i_0_46 ).
cnf(c_0_55,negated_conjecture,
esk14_0 = esk15_0,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_53]) ).
cnf(c_0_56,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_54,c_0_55]),c_0_53]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : GEO086+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.35 % Computer : n007.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Sat Jun 18 13:33:15 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.46 # ENIGMATIC: Selected SinE mode:
% 0.20/0.47 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.47 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.20/0.47 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.20/0.47 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 8.51/2.52 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 8.51/2.52 # Version: 2.1pre011
% 8.51/2.52 # Preprocessing time : 0.019 s
% 8.51/2.52
% 8.51/2.52 # Proof found!
% 8.51/2.52 # SZS status Theorem
% 8.51/2.52 # SZS output start CNFRefutation
% See solution above
% 8.51/2.52 # Proof object total steps : 10
% 8.51/2.52 # Proof object clause steps : 6
% 8.51/2.52 # Proof object formula steps : 4
% 8.51/2.52 # Proof object conjectures : 8
% 8.51/2.52 # Proof object clause conjectures : 5
% 8.51/2.52 # Proof object formula conjectures : 3
% 8.51/2.52 # Proof object initial clauses used : 4
% 8.51/2.52 # Proof object initial formulas used : 4
% 8.51/2.52 # Proof object generating inferences : 1
% 8.51/2.52 # Proof object simplifying inferences : 3
% 8.51/2.52 # Training examples: 0 positive, 0 negative
% 8.51/2.52 # Parsed axioms : 46
% 8.51/2.52 # Removed by relevancy pruning/SinE : 0
% 8.51/2.52 # Initial clauses : 46
% 8.51/2.52 # Removed in clause preprocessing : 0
% 8.51/2.52 # Initial clauses in saturation : 46
% 8.51/2.52 # Processed clauses : 49
% 8.51/2.52 # ...of these trivial : 0
% 8.51/2.52 # ...subsumed : 0
% 8.51/2.52 # ...remaining for further processing : 49
% 8.51/2.52 # Other redundant clauses eliminated : 3
% 8.51/2.52 # Clauses deleted for lack of memory : 0
% 8.51/2.52 # Backward-subsumed : 0
% 8.51/2.52 # Backward-rewritten : 2
% 8.51/2.52 # Generated clauses : 63
% 8.51/2.52 # ...of the previous two non-trivial : 52
% 8.51/2.52 # Contextual simplify-reflections : 0
% 8.51/2.52 # Paramodulations : 49
% 8.51/2.52 # Factorizations : 8
% 8.51/2.52 # Equation resolutions : 6
% 8.51/2.52 # Propositional unsat checks : 0
% 8.51/2.52 # Propositional unsat check successes : 0
% 8.51/2.52 # Current number of processed clauses : 47
% 8.51/2.52 # Positive orientable unit clauses : 3
% 8.51/2.52 # Positive unorientable unit clauses: 0
% 8.51/2.52 # Negative unit clauses : 1
% 8.51/2.52 # Non-unit-clauses : 43
% 8.51/2.52 # Current number of unprocessed clauses: 47
% 8.51/2.52 # ...number of literals in the above : 228
% 8.51/2.52 # Current number of archived formulas : 0
% 8.51/2.52 # Current number of archived clauses : 2
% 8.51/2.52 # Clause-clause subsumption calls (NU) : 327
% 8.51/2.52 # Rec. Clause-clause subsumption calls : 124
% 8.51/2.52 # Non-unit clause-clause subsumptions : 0
% 8.51/2.52 # Unit Clause-clause subsumption calls : 20
% 8.51/2.52 # Rewrite failures with RHS unbound : 0
% 8.51/2.52 # BW rewrite match attempts : 1
% 8.51/2.52 # BW rewrite match successes : 1
% 8.51/2.52 # Condensation attempts : 0
% 8.51/2.52 # Condensation successes : 0
% 8.51/2.52 # Termbank termtop insertions : 1890
% 8.51/2.52
% 8.51/2.52 # -------------------------------------------------
% 8.51/2.52 # User time : 0.020 s
% 8.51/2.52 # System time : 0.002 s
% 8.51/2.52 # Total time : 0.022 s
% 8.51/2.52 # ...preprocessing : 0.019 s
% 8.51/2.52 # ...main loop : 0.003 s
% 8.51/2.52 # Maximum resident set size: 7128 pages
% 8.51/2.52
%------------------------------------------------------------------------------