TSTP Solution File: GEO226+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GEO226+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n017.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:44:40 EDT 2022
% Result : Theorem 7.30s 2.37s
% Output : CNFRefutation 7.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 6
% Syntax : Number of clauses : 16 ( 6 unt; 5 nHn; 11 RR)
% Number of literals : 28 ( 0 equ; 14 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 20 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_13,plain,
( ~ convergent_lines(X1,X2)
| ~ apart_point_and_line(intersection_point(X1,X2),X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xxag0s8z/input.p',i_0_13) ).
cnf(i_0_15,negated_conjecture,
( apart_point_and_line(X1,esk1_0)
| apart_point_and_line(X1,esk2_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xxag0s8z/input.p',i_0_15) ).
cnf(i_0_6,plain,
( convergent_lines(X1,X2)
| convergent_lines(X3,X2)
| ~ convergent_lines(X3,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xxag0s8z/input.p',i_0_6) ).
cnf(i_0_17,negated_conjecture,
convergent_lines(esk1_0,esk2_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xxag0s8z/input.p',i_0_17) ).
cnf(i_0_12,plain,
( ~ convergent_lines(X1,X2)
| ~ apart_point_and_line(intersection_point(X1,X2),X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xxag0s8z/input.p',i_0_12) ).
cnf(i_0_3,plain,
~ convergent_lines(X1,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xxag0s8z/input.p',i_0_3) ).
cnf(c_0_24,plain,
( ~ convergent_lines(X1,X2)
| ~ apart_point_and_line(intersection_point(X1,X2),X2) ),
i_0_13 ).
cnf(c_0_25,negated_conjecture,
( apart_point_and_line(X1,esk1_0)
| apart_point_and_line(X1,esk2_0) ),
i_0_15 ).
cnf(c_0_26,plain,
( convergent_lines(X1,X2)
| convergent_lines(X3,X2)
| ~ convergent_lines(X3,X1) ),
i_0_6 ).
cnf(c_0_27,negated_conjecture,
convergent_lines(esk1_0,esk2_0),
i_0_17 ).
cnf(c_0_28,plain,
( ~ convergent_lines(X1,X2)
| ~ apart_point_and_line(intersection_point(X1,X2),X1) ),
i_0_12 ).
cnf(c_0_29,negated_conjecture,
( apart_point_and_line(intersection_point(X1,esk1_0),esk2_0)
| ~ convergent_lines(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_30,plain,
~ convergent_lines(X1,X1),
i_0_3 ).
cnf(c_0_31,negated_conjecture,
( convergent_lines(esk1_0,X1)
| convergent_lines(esk2_0,X1) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_32,plain,
~ convergent_lines(esk2_0,esk1_0),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_33,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : GEO226+1 : TPTP v8.1.0. Released v3.3.0.
% 0.10/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n017.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 : Sat Jun 18 09:44:29 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.44 # 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.30/2.37 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN:
% 7.30/2.37 # Version: 2.1pre011
% 7.30/2.37 # Preprocessing time : 0.008 s
% 7.30/2.37
% 7.30/2.37 # Proof found!
% 7.30/2.37 # SZS status Theorem
% 7.30/2.37 # SZS output start CNFRefutation
% See solution above
% 7.30/2.37 # Proof object total steps : 16
% 7.30/2.37 # Proof object clause steps : 10
% 7.30/2.37 # Proof object formula steps : 6
% 7.30/2.37 # Proof object conjectures : 6
% 7.30/2.37 # Proof object clause conjectures : 4
% 7.30/2.37 # Proof object formula conjectures : 2
% 7.30/2.37 # Proof object initial clauses used : 6
% 7.30/2.37 # Proof object initial formulas used : 6
% 7.30/2.37 # Proof object generating inferences : 4
% 7.30/2.37 # Proof object simplifying inferences : 1
% 7.30/2.37 # Training examples: 0 positive, 0 negative
% 7.30/2.37 # Parsed axioms : 21
% 7.30/2.37 # Removed by relevancy pruning/SinE : 0
% 7.30/2.37 # Initial clauses : 21
% 7.30/2.37 # Removed in clause preprocessing : 0
% 7.30/2.37 # Initial clauses in saturation : 21
% 7.30/2.37 # Processed clauses : 27
% 7.30/2.37 # ...of these trivial : 0
% 7.30/2.37 # ...subsumed : 3
% 7.30/2.37 # ...remaining for further processing : 24
% 7.30/2.37 # Other redundant clauses eliminated : 0
% 7.30/2.37 # Clauses deleted for lack of memory : 0
% 7.30/2.37 # Backward-subsumed : 0
% 7.30/2.37 # Backward-rewritten : 0
% 7.30/2.37 # Generated clauses : 30
% 7.30/2.37 # ...of the previous two non-trivial : 27
% 7.30/2.37 # Contextual simplify-reflections : 0
% 7.30/2.37 # Paramodulations : 12
% 7.30/2.37 # Factorizations : 18
% 7.30/2.37 # Equation resolutions : 0
% 7.30/2.37 # Propositional unsat checks : 0
% 7.30/2.37 # Propositional unsat check successes : 0
% 7.30/2.37 # Current number of processed clauses : 24
% 7.30/2.37 # Positive orientable unit clauses : 3
% 7.30/2.37 # Positive unorientable unit clauses: 0
% 7.30/2.37 # Negative unit clauses : 4
% 7.30/2.37 # Non-unit-clauses : 17
% 7.30/2.37 # Current number of unprocessed clauses: 21
% 7.30/2.37 # ...number of literals in the above : 66
% 7.30/2.37 # Current number of archived formulas : 0
% 7.30/2.37 # Current number of archived clauses : 0
% 7.30/2.37 # Clause-clause subsumption calls (NU) : 19
% 7.30/2.37 # Rec. Clause-clause subsumption calls : 8
% 7.30/2.37 # Non-unit clause-clause subsumptions : 0
% 7.30/2.37 # Unit Clause-clause subsumption calls : 6
% 7.30/2.37 # Rewrite failures with RHS unbound : 0
% 7.30/2.37 # BW rewrite match attempts : 0
% 7.30/2.37 # BW rewrite match successes : 0
% 7.30/2.37 # Condensation attempts : 0
% 7.30/2.37 # Condensation successes : 0
% 7.30/2.37 # Termbank termtop insertions : 626
% 7.30/2.37
% 7.30/2.37 # -------------------------------------------------
% 7.30/2.37 # User time : 0.007 s
% 7.30/2.37 # System time : 0.002 s
% 7.30/2.37 # Total time : 0.009 s
% 7.30/2.37 # ...preprocessing : 0.008 s
% 7.30/2.37 # ...main loop : 0.001 s
% 7.30/2.37 # Maximum resident set size: 7136 pages
% 7.30/2.37
%------------------------------------------------------------------------------