TSTP Solution File: GEO255+3 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : GEO255+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n003.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:08 EDT 2022
% Result : Theorem 0.25s 1.42s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 9
% Syntax : Number of formulae : 47 ( 13 unt; 0 def)
% Number of atoms : 108 ( 0 equ)
% Maximal formula atoms : 13 ( 2 avg)
% Number of connectives : 102 ( 41 ~; 43 |; 13 &)
% ( 2 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 91 ( 10 sgn 47 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(a4_defns,axiom,
! [X1,X2] :
( equally_directed_lines(X1,X2)
<=> ~ unequally_directed_lines(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO009+0.ax',a4_defns) ).
fof(ax5_basics,axiom,
! [X4] : equally_directed_lines(X4,X4),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO009+0.ax',ax5_basics) ).
fof(ax4_defns,axiom,
! [X4,X3,X6] :
( before_on_line(X4,X3,X6)
<=> ( distinct_points(X3,X6)
& incident_point_and_line(X3,X4)
& incident_point_and_line(X6,X4)
& equally_directed_lines(X4,line_connecting(X3,X6)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO009+0.ax',ax4_defns) ).
fof(ax6_basics,axiom,
! [X4,X5,X8] :
( unequally_directed_lines(X4,X5)
=> ( unequally_directed_lines(X4,X8)
| unequally_directed_lines(X5,X8) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO009+0.ax',ax6_basics) ).
fof(ax8_basics,axiom,
! [X4,X5] :
( unequally_directed_lines(X4,X5)
| unequally_directed_lines(X4,reverse_line(X5)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO009+0.ax',ax8_basics) ).
fof(ax9_basics,axiom,
! [X4,X5] :
( ( unequally_directed_lines(X4,X5)
& unequally_directed_lines(X4,reverse_line(X5)) )
=> ( left_convergent_lines(X4,X5)
| left_convergent_lines(X4,reverse_line(X5)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO009+0.ax',ax9_basics) ).
fof(ax11_basics,axiom,
! [X4,X5] :
~ ( left_convergent_lines(X4,X5)
| left_convergent_lines(X4,reverse_line(X5)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO009+0.ax',ax11_basics) ).
fof(con,conjecture,
! [X4,X3,X6] :
~ ( before_on_line(X4,X3,X6)
& before_on_line(X4,X6,X3) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',con) ).
fof(ax9_cons_objs,axiom,
! [X3,X6] :
( distinct_points(X3,X6)
=> equally_directed_lines(line_connecting(X3,X6),reverse_line(line_connecting(X6,X3))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO009+0.ax',ax9_cons_objs) ).
fof(c_0_9,plain,
! [X3,X4,X3,X4] :
( ( ~ equally_directed_lines(X3,X4)
| ~ unequally_directed_lines(X3,X4) )
& ( unequally_directed_lines(X3,X4)
| equally_directed_lines(X3,X4) ) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[a4_defns])])])])]) ).
fof(c_0_10,plain,
! [X5] : equally_directed_lines(X5,X5),
inference(variable_rename,[status(thm)],[ax5_basics]) ).
fof(c_0_11,plain,
! [X7,X8,X9,X7,X8,X9] :
( ( distinct_points(X8,X9)
| ~ before_on_line(X7,X8,X9) )
& ( incident_point_and_line(X8,X7)
| ~ before_on_line(X7,X8,X9) )
& ( incident_point_and_line(X9,X7)
| ~ before_on_line(X7,X8,X9) )
& ( equally_directed_lines(X7,line_connecting(X8,X9))
| ~ before_on_line(X7,X8,X9) )
& ( ~ distinct_points(X8,X9)
| ~ incident_point_and_line(X8,X7)
| ~ incident_point_and_line(X9,X7)
| ~ equally_directed_lines(X7,line_connecting(X8,X9))
| before_on_line(X7,X8,X9) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax4_defns])])])])]) ).
fof(c_0_12,plain,
! [X9,X10,X11] :
( ~ unequally_directed_lines(X9,X10)
| unequally_directed_lines(X9,X11)
| unequally_directed_lines(X10,X11) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax6_basics])])])]) ).
fof(c_0_13,plain,
! [X6,X7] :
( unequally_directed_lines(X6,X7)
| unequally_directed_lines(X6,reverse_line(X7)) ),
inference(variable_rename,[status(thm)],[ax8_basics]) ).
cnf(c_0_14,plain,
( ~ unequally_directed_lines(X1,X2)
| ~ equally_directed_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,plain,
equally_directed_lines(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_16,plain,
! [X6,X7] :
( ~ unequally_directed_lines(X6,X7)
| ~ unequally_directed_lines(X6,reverse_line(X7))
| left_convergent_lines(X6,X7)
| left_convergent_lines(X6,reverse_line(X7)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax9_basics])]) ).
fof(c_0_17,plain,
! [X6,X7,X6,X7] :
( ~ left_convergent_lines(X6,X7)
& ~ left_convergent_lines(X6,reverse_line(X7)) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax11_basics])])])]) ).
cnf(c_0_18,plain,
( equally_directed_lines(X1,line_connecting(X2,X3))
| ~ before_on_line(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_19,plain,
( unequally_directed_lines(X1,X2)
| unequally_directed_lines(X3,X2)
| ~ unequally_directed_lines(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_20,plain,
( unequally_directed_lines(X1,reverse_line(X2))
| unequally_directed_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_21,negated_conjecture,
~ ! [X4,X3,X6] :
~ ( before_on_line(X4,X3,X6)
& before_on_line(X4,X6,X3) ),
inference(assume_negation,[status(cth)],[con]) ).
cnf(c_0_22,plain,
~ unequally_directed_lines(X1,X1),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_23,plain,
( left_convergent_lines(X1,reverse_line(X2))
| left_convergent_lines(X1,X2)
| ~ unequally_directed_lines(X1,reverse_line(X2))
| ~ unequally_directed_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_24,plain,
~ left_convergent_lines(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_25,plain,
( ~ before_on_line(X1,X2,X3)
| ~ unequally_directed_lines(X1,line_connecting(X2,X3)) ),
inference(spm,[status(thm)],[c_0_14,c_0_18]) ).
cnf(c_0_26,plain,
( unequally_directed_lines(reverse_line(X1),X2)
| unequally_directed_lines(X3,X1)
| unequally_directed_lines(X3,X2) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
fof(c_0_27,negated_conjecture,
( before_on_line(esk1_0,esk2_0,esk3_0)
& before_on_line(esk1_0,esk3_0,esk2_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_21])])]) ).
cnf(c_0_28,plain,
unequally_directed_lines(reverse_line(X1),X1),
inference(spm,[status(thm)],[c_0_22,c_0_20]) ).
cnf(c_0_29,plain,
( ~ unequally_directed_lines(X1,reverse_line(X2))
| ~ unequally_directed_lines(X1,X2) ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_23,c_0_24]),c_0_24]) ).
cnf(c_0_30,plain,
( unequally_directed_lines(reverse_line(X1),line_connecting(X2,X3))
| unequally_directed_lines(X4,X1)
| ~ before_on_line(X4,X2,X3) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_31,negated_conjecture,
before_on_line(esk1_0,esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
fof(c_0_32,plain,
! [X7,X8] :
( ~ distinct_points(X7,X8)
| equally_directed_lines(line_connecting(X7,X8),reverse_line(line_connecting(X8,X7))) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax9_cons_objs])]) ).
cnf(c_0_33,plain,
( unequally_directed_lines(reverse_line(X1),X2)
| unequally_directed_lines(X1,X2) ),
inference(spm,[status(thm)],[c_0_19,c_0_28]) ).
cnf(c_0_34,negated_conjecture,
before_on_line(esk1_0,esk3_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_35,plain,
~ unequally_directed_lines(reverse_line(reverse_line(X1)),X1),
inference(spm,[status(thm)],[c_0_29,c_0_28]) ).
cnf(c_0_36,negated_conjecture,
( unequally_directed_lines(reverse_line(X1),line_connecting(esk2_0,esk3_0))
| unequally_directed_lines(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_37,plain,
( equally_directed_lines(line_connecting(X1,X2),reverse_line(line_connecting(X2,X1)))
| ~ distinct_points(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_38,plain,
( unequally_directed_lines(X1,reverse_line(X2))
| ~ unequally_directed_lines(reverse_line(X1),X2) ),
inference(spm,[status(thm)],[c_0_29,c_0_33]) ).
cnf(c_0_39,negated_conjecture,
( unequally_directed_lines(reverse_line(X1),line_connecting(esk3_0,esk2_0))
| unequally_directed_lines(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_30,c_0_34]) ).
cnf(c_0_40,plain,
( distinct_points(X2,X3)
| ~ before_on_line(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_41,negated_conjecture,
unequally_directed_lines(esk1_0,reverse_line(line_connecting(esk2_0,esk3_0))),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_42,plain,
( ~ distinct_points(X1,X2)
| ~ unequally_directed_lines(line_connecting(X1,X2),reverse_line(line_connecting(X2,X1))) ),
inference(spm,[status(thm)],[c_0_14,c_0_37]) ).
cnf(c_0_43,negated_conjecture,
( unequally_directed_lines(X1,reverse_line(line_connecting(esk3_0,esk2_0)))
| unequally_directed_lines(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_44,negated_conjecture,
distinct_points(esk2_0,esk3_0),
inference(spm,[status(thm)],[c_0_40,c_0_31]) ).
cnf(c_0_45,negated_conjecture,
~ unequally_directed_lines(esk1_0,line_connecting(esk2_0,esk3_0)),
inference(spm,[status(thm)],[c_0_29,c_0_41]) ).
cnf(c_0_46,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44])]),c_0_45]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : GEO255+3 : TPTP v8.1.0. Released v4.0.0.
% 0.08/0.13 % Command : run_ET %s %d
% 0.13/0.35 % Computer : n003.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 14:38:28 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.25/1.42 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.25/1.42 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.25/1.42 # Preprocessing time : 0.014 s
% 0.25/1.42
% 0.25/1.42 # Failure: Out of unprocessed clauses!
% 0.25/1.42 # OLD status GaveUp
% 0.25/1.42 # Parsed axioms : 37
% 0.25/1.42 # Removed by relevancy pruning/SinE : 36
% 0.25/1.42 # Initial clauses : 2
% 0.25/1.42 # Removed in clause preprocessing : 0
% 0.25/1.42 # Initial clauses in saturation : 2
% 0.25/1.42 # Processed clauses : 2
% 0.25/1.42 # ...of these trivial : 0
% 0.25/1.42 # ...subsumed : 0
% 0.25/1.42 # ...remaining for further processing : 2
% 0.25/1.42 # Other redundant clauses eliminated : 0
% 0.25/1.42 # Clauses deleted for lack of memory : 0
% 0.25/1.42 # Backward-subsumed : 0
% 0.25/1.42 # Backward-rewritten : 0
% 0.25/1.42 # Generated clauses : 0
% 0.25/1.42 # ...of the previous two non-trivial : 0
% 0.25/1.42 # Contextual simplify-reflections : 0
% 0.25/1.42 # Paramodulations : 0
% 0.25/1.42 # Factorizations : 0
% 0.25/1.42 # Equation resolutions : 0
% 0.25/1.42 # Current number of processed clauses : 2
% 0.25/1.42 # Positive orientable unit clauses : 2
% 0.25/1.42 # Positive unorientable unit clauses: 0
% 0.25/1.42 # Negative unit clauses : 0
% 0.25/1.42 # Non-unit-clauses : 0
% 0.25/1.42 # Current number of unprocessed clauses: 0
% 0.25/1.42 # ...number of literals in the above : 0
% 0.25/1.42 # Current number of archived formulas : 0
% 0.25/1.42 # Current number of archived clauses : 0
% 0.25/1.42 # Clause-clause subsumption calls (NU) : 0
% 0.25/1.42 # Rec. Clause-clause subsumption calls : 0
% 0.25/1.42 # Non-unit clause-clause subsumptions : 0
% 0.25/1.42 # Unit Clause-clause subsumption calls : 0
% 0.25/1.42 # Rewrite failures with RHS unbound : 0
% 0.25/1.42 # BW rewrite match attempts : 0
% 0.25/1.42 # BW rewrite match successes : 0
% 0.25/1.42 # Condensation attempts : 0
% 0.25/1.42 # Condensation successes : 0
% 0.25/1.42 # Termbank termtop insertions : 497
% 0.25/1.42
% 0.25/1.42 # -------------------------------------------------
% 0.25/1.42 # User time : 0.013 s
% 0.25/1.42 # System time : 0.001 s
% 0.25/1.42 # Total time : 0.014 s
% 0.25/1.42 # Maximum resident set size: 2700 pages
% 0.25/1.42 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.25/1.42 # Preprocessing time : 0.018 s
% 0.25/1.42
% 0.25/1.42 # Proof found!
% 0.25/1.42 # SZS status Theorem
% 0.25/1.42 # SZS output start CNFRefutation
% See solution above
% 0.25/1.42 # Proof object total steps : 47
% 0.25/1.42 # Proof object clause steps : 28
% 0.25/1.42 # Proof object formula steps : 19
% 0.25/1.42 # Proof object conjectures : 12
% 0.25/1.42 # Proof object clause conjectures : 9
% 0.25/1.42 # Proof object formula conjectures : 3
% 0.25/1.42 # Proof object initial clauses used : 11
% 0.25/1.42 # Proof object initial formulas used : 9
% 0.25/1.42 # Proof object generating inferences : 16
% 0.25/1.42 # Proof object simplifying inferences : 5
% 0.25/1.42 # Training examples: 0 positive, 0 negative
% 0.25/1.42 # Parsed axioms : 37
% 0.25/1.42 # Removed by relevancy pruning/SinE : 0
% 0.25/1.42 # Initial clauses : 68
% 0.25/1.42 # Removed in clause preprocessing : 0
% 0.25/1.42 # Initial clauses in saturation : 68
% 0.25/1.42 # Processed clauses : 187
% 0.25/1.42 # ...of these trivial : 2
% 0.25/1.42 # ...subsumed : 47
% 0.25/1.42 # ...remaining for further processing : 138
% 0.25/1.42 # Other redundant clauses eliminated : 0
% 0.25/1.42 # Clauses deleted for lack of memory : 0
% 0.25/1.42 # Backward-subsumed : 5
% 0.25/1.42 # Backward-rewritten : 0
% 0.25/1.42 # Generated clauses : 362
% 0.25/1.42 # ...of the previous two non-trivial : 258
% 0.25/1.42 # Contextual simplify-reflections : 6
% 0.25/1.42 # Paramodulations : 316
% 0.25/1.42 # Factorizations : 46
% 0.25/1.42 # Equation resolutions : 0
% 0.25/1.42 # Current number of processed clauses : 133
% 0.25/1.42 # Positive orientable unit clauses : 29
% 0.25/1.42 # Positive unorientable unit clauses: 0
% 0.25/1.42 # Negative unit clauses : 38
% 0.25/1.42 # Non-unit-clauses : 66
% 0.25/1.42 # Current number of unprocessed clauses: 137
% 0.25/1.42 # ...number of literals in the above : 354
% 0.25/1.42 # Current number of archived formulas : 0
% 0.25/1.42 # Current number of archived clauses : 5
% 0.25/1.42 # Clause-clause subsumption calls (NU) : 1289
% 0.25/1.42 # Rec. Clause-clause subsumption calls : 887
% 0.25/1.42 # Non-unit clause-clause subsumptions : 35
% 0.25/1.42 # Unit Clause-clause subsumption calls : 280
% 0.25/1.42 # Rewrite failures with RHS unbound : 0
% 0.25/1.42 # BW rewrite match attempts : 81
% 0.25/1.42 # BW rewrite match successes : 0
% 0.25/1.42 # Condensation attempts : 0
% 0.25/1.42 # Condensation successes : 0
% 0.25/1.42 # Termbank termtop insertions : 7530
% 0.25/1.42
% 0.25/1.42 # -------------------------------------------------
% 0.25/1.42 # User time : 0.026 s
% 0.25/1.42 # System time : 0.003 s
% 0.25/1.42 # Total time : 0.029 s
% 0.25/1.42 # Maximum resident set size: 3544 pages
%------------------------------------------------------------------------------