TSTP Solution File: GEO237+3 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : GEO237+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n012.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 04:05:00 EDT 2022
% Result : Theorem 0.23s 1.41s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of formulae : 16 ( 5 unt; 0 def)
% Number of atoms : 42 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 42 ( 16 ~; 13 |; 7 &)
% ( 2 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-1 aty)
% Number of variables : 36 ( 12 sgn 26 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(a2_defns,axiom,
! [X1,X2] :
( right_apart_point(X1,X2)
<=> left_apart_point(X1,reverse_line(X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO009+0.ax',a2_defns) ).
fof(ax10_basics,axiom,
! [X3,X4] :
~ ( left_apart_point(X3,X4)
| left_apart_point(X3,reverse_line(X4)) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO009+0.ax',ax10_basics) ).
fof(con,conjecture,
! [X3,X6,X7,X4] :
( apart_point_and_line(X7,X4)
=> ( divides_points(X4,X3,X6)
=> ( divides_points(X4,X3,X7)
| divides_points(X4,X6,X7) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',con) ).
fof(a6_defns,axiom,
! [X3,X4] :
( apart_point_and_line(X3,X4)
<=> ( left_apart_point(X3,X4)
| right_apart_point(X3,X4) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO009+0.ax',a6_defns) ).
fof(c_0_4,plain,
! [X3,X4,X3,X4] :
( ( ~ right_apart_point(X3,X4)
| left_apart_point(X3,reverse_line(X4)) )
& ( ~ left_apart_point(X3,reverse_line(X4))
| right_apart_point(X3,X4) ) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[a2_defns])])])]) ).
fof(c_0_5,plain,
! [X5,X6,X5,X6] :
( ~ left_apart_point(X5,X6)
& ~ left_apart_point(X5,reverse_line(X6)) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax10_basics])])])]) ).
fof(c_0_6,negated_conjecture,
~ ! [X3,X6,X7,X4] :
( apart_point_and_line(X7,X4)
=> ( divides_points(X4,X3,X6)
=> ( divides_points(X4,X3,X7)
| divides_points(X4,X6,X7) ) ) ),
inference(assume_negation,[status(cth)],[con]) ).
fof(c_0_7,plain,
! [X5,X6,X5,X6] :
( ( ~ apart_point_and_line(X5,X6)
| left_apart_point(X5,X6)
| right_apart_point(X5,X6) )
& ( ~ left_apart_point(X5,X6)
| apart_point_and_line(X5,X6) )
& ( ~ right_apart_point(X5,X6)
| apart_point_and_line(X5,X6) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[a6_defns])])])])]) ).
cnf(c_0_8,plain,
( left_apart_point(X1,reverse_line(X2))
| ~ right_apart_point(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_9,plain,
~ left_apart_point(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_10,negated_conjecture,
( apart_point_and_line(esk3_0,esk4_0)
& divides_points(esk4_0,esk1_0,esk2_0)
& ~ divides_points(esk4_0,esk1_0,esk3_0)
& ~ divides_points(esk4_0,esk2_0,esk3_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
cnf(c_0_11,plain,
( right_apart_point(X1,X2)
| left_apart_point(X1,X2)
| ~ apart_point_and_line(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
~ right_apart_point(X1,X2),
inference(sr,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,negated_conjecture,
apart_point_and_line(esk3_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,plain,
~ apart_point_and_line(X1,X2),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_11,c_0_12]),c_0_9]) ).
cnf(c_0_15,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_13,c_0_14]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : GEO237+3 : TPTP v8.1.0. Released v4.0.0.
% 0.04/0.13 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n012.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 13:58:38 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.23/1.41 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.41 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.41 # Preprocessing time : 0.017 s
% 0.23/1.41
% 0.23/1.41 # Proof found!
% 0.23/1.41 # SZS status Theorem
% 0.23/1.41 # SZS output start CNFRefutation
% See solution above
% 0.23/1.41 # Proof object total steps : 16
% 0.23/1.41 # Proof object clause steps : 7
% 0.23/1.41 # Proof object formula steps : 9
% 0.23/1.41 # Proof object conjectures : 5
% 0.23/1.41 # Proof object clause conjectures : 2
% 0.23/1.41 # Proof object formula conjectures : 3
% 0.23/1.41 # Proof object initial clauses used : 4
% 0.23/1.41 # Proof object initial formulas used : 4
% 0.23/1.41 # Proof object generating inferences : 0
% 0.23/1.41 # Proof object simplifying inferences : 4
% 0.23/1.41 # Training examples: 0 positive, 0 negative
% 0.23/1.41 # Parsed axioms : 37
% 0.23/1.41 # Removed by relevancy pruning/SinE : 18
% 0.23/1.41 # Initial clauses : 37
% 0.23/1.41 # Removed in clause preprocessing : 0
% 0.23/1.41 # Initial clauses in saturation : 37
% 0.23/1.41 # Processed clauses : 18
% 0.23/1.41 # ...of these trivial : 0
% 0.23/1.41 # ...subsumed : 4
% 0.23/1.41 # ...remaining for further processing : 14
% 0.23/1.41 # Other redundant clauses eliminated : 0
% 0.23/1.41 # Clauses deleted for lack of memory : 0
% 0.23/1.41 # Backward-subsumed : 0
% 0.23/1.41 # Backward-rewritten : 0
% 0.23/1.41 # Generated clauses : 3
% 0.23/1.41 # ...of the previous two non-trivial : 1
% 0.23/1.41 # Contextual simplify-reflections : 0
% 0.23/1.41 # Paramodulations : 2
% 0.23/1.41 # Factorizations : 0
% 0.23/1.41 # Equation resolutions : 0
% 0.23/1.41 # Current number of processed clauses : 13
% 0.23/1.41 # Positive orientable unit clauses : 2
% 0.23/1.41 # Positive unorientable unit clauses: 0
% 0.23/1.41 # Negative unit clauses : 7
% 0.23/1.41 # Non-unit-clauses : 4
% 0.23/1.41 # Current number of unprocessed clauses: 20
% 0.23/1.41 # ...number of literals in the above : 62
% 0.23/1.41 # Current number of archived formulas : 0
% 0.23/1.41 # Current number of archived clauses : 1
% 0.23/1.41 # Clause-clause subsumption calls (NU) : 0
% 0.23/1.41 # Rec. Clause-clause subsumption calls : 0
% 0.23/1.41 # Non-unit clause-clause subsumptions : 0
% 0.23/1.41 # Unit Clause-clause subsumption calls : 10
% 0.23/1.41 # Rewrite failures with RHS unbound : 0
% 0.23/1.41 # BW rewrite match attempts : 1
% 0.23/1.41 # BW rewrite match successes : 0
% 0.23/1.41 # Condensation attempts : 0
% 0.23/1.41 # Condensation successes : 0
% 0.23/1.41 # Termbank termtop insertions : 2062
% 0.23/1.41
% 0.23/1.41 # -------------------------------------------------
% 0.23/1.41 # User time : 0.013 s
% 0.23/1.41 # System time : 0.004 s
% 0.23/1.41 # Total time : 0.017 s
% 0.23/1.41 # Maximum resident set size: 2760 pages
%------------------------------------------------------------------------------