TSTP Solution File: GEO191+3 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : GEO191+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n013.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:04:30 EDT 2022
% Result : Theorem 0.25s 1.42s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 9
% Syntax : Number of formulae : 42 ( 16 unt; 0 def)
% Number of atoms : 93 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 77 ( 26 ~; 36 |; 9 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 77 ( 11 sgn 44 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(con,conjecture,
! [X1,X2,X4,X5] :
( ( convergent_lines(X1,X2)
& convergent_lines(X4,X5)
& ( apart_point_and_line(intersection_point(X1,X2),X4)
| apart_point_and_line(intersection_point(X1,X2),X5) ) )
=> ( apart_point_and_line(intersection_point(X4,X5),X1)
| apart_point_and_line(intersection_point(X4,X5),X2) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',con) ).
fof(ceq2,axiom,
! [X1,X2,X3] :
( apart_point_and_line(X1,X2)
=> ( distinct_lines(X2,X3)
| apart_point_and_line(X1,X3) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+0.ax',ceq2) ).
fof(p1,axiom,
! [X1,X2] :
( distinct_lines(X1,X2)
=> convergent_lines(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+1.ax',p1) ).
fof(cp2,axiom,
! [X1,X2] : ~ apart_point_and_line(X1,parallel_through_point(X2,X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+2.ax',cp2) ).
fof(ax6,axiom,
! [X1,X2,X3] :
( convergent_lines(X1,X2)
=> ( convergent_lines(X1,X3)
| convergent_lines(X2,X3) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+0.ax',ax6) ).
fof(cp1,axiom,
! [X1,X2] : ~ convergent_lines(parallel_through_point(X2,X1),X2),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+2.ax',cp1) ).
fof(couo1,axiom,
! [X6,X7,X8] :
( ( ~ unorthogonal_lines(X6,X7)
& ~ unorthogonal_lines(X6,X8) )
=> ~ convergent_lines(X7,X8) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+4.ax',couo1) ).
fof(ooc1,axiom,
! [X9,X6] : ~ unorthogonal_lines(orthogonal_through_point(X6,X9),X6),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+3.ax',ooc1) ).
fof(apart3,axiom,
! [X1] : ~ convergent_lines(X1,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+0.ax',apart3) ).
fof(c_0_9,negated_conjecture,
~ ! [X1,X2,X4,X5] :
( ( convergent_lines(X1,X2)
& convergent_lines(X4,X5)
& ( apart_point_and_line(intersection_point(X1,X2),X4)
| apart_point_and_line(intersection_point(X1,X2),X5) ) )
=> ( apart_point_and_line(intersection_point(X4,X5),X1)
| apart_point_and_line(intersection_point(X4,X5),X2) ) ),
inference(assume_negation,[status(cth)],[con]) ).
fof(c_0_10,plain,
! [X4,X5,X6] :
( ~ apart_point_and_line(X4,X5)
| distinct_lines(X5,X6)
| apart_point_and_line(X4,X6) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ceq2])])])]) ).
fof(c_0_11,negated_conjecture,
( convergent_lines(esk1_0,esk2_0)
& convergent_lines(esk3_0,esk4_0)
& ( apart_point_and_line(intersection_point(esk1_0,esk2_0),esk3_0)
| apart_point_and_line(intersection_point(esk1_0,esk2_0),esk4_0) )
& ~ apart_point_and_line(intersection_point(esk3_0,esk4_0),esk1_0)
& ~ apart_point_and_line(intersection_point(esk3_0,esk4_0),esk2_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])]) ).
fof(c_0_12,plain,
! [X3,X4] :
( ~ distinct_lines(X3,X4)
| convergent_lines(X3,X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[p1])]) ).
cnf(c_0_13,plain,
( apart_point_and_line(X1,X2)
| distinct_lines(X3,X2)
| ~ apart_point_and_line(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,negated_conjecture,
( apart_point_and_line(intersection_point(esk1_0,esk2_0),esk4_0)
| apart_point_and_line(intersection_point(esk1_0,esk2_0),esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_15,plain,
! [X3,X4] : ~ apart_point_and_line(X3,parallel_through_point(X4,X3)),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[cp2])]) ).
cnf(c_0_16,plain,
( convergent_lines(X1,X2)
| ~ distinct_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,negated_conjecture,
( apart_point_and_line(intersection_point(esk1_0,esk2_0),esk3_0)
| apart_point_and_line(intersection_point(esk1_0,esk2_0),X1)
| distinct_lines(esk4_0,X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
fof(c_0_18,plain,
! [X4,X5,X6] :
( ~ convergent_lines(X4,X5)
| convergent_lines(X4,X6)
| convergent_lines(X5,X6) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax6])])])]) ).
cnf(c_0_19,plain,
~ apart_point_and_line(X1,parallel_through_point(X2,X1)),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_20,negated_conjecture,
( apart_point_and_line(intersection_point(esk1_0,esk2_0),esk3_0)
| apart_point_and_line(intersection_point(esk1_0,esk2_0),X1)
| convergent_lines(esk4_0,X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
fof(c_0_21,plain,
! [X3,X4] : ~ convergent_lines(parallel_through_point(X4,X3),X4),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[cp1])]) ).
cnf(c_0_22,plain,
( convergent_lines(X1,X2)
| convergent_lines(X3,X2)
| ~ convergent_lines(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_23,negated_conjecture,
( apart_point_and_line(intersection_point(esk1_0,esk2_0),esk3_0)
| convergent_lines(esk4_0,parallel_through_point(X1,intersection_point(esk1_0,esk2_0))) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
fof(c_0_24,plain,
! [X9,X10,X11] :
( unorthogonal_lines(X9,X10)
| unorthogonal_lines(X9,X11)
| ~ convergent_lines(X10,X11) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[couo1])])]) ).
cnf(c_0_25,plain,
~ convergent_lines(parallel_through_point(X1,X2),X1),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_26,negated_conjecture,
( apart_point_and_line(intersection_point(esk1_0,esk2_0),esk3_0)
| convergent_lines(parallel_through_point(X1,intersection_point(esk1_0,esk2_0)),X2)
| convergent_lines(esk4_0,X2) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_27,plain,
( unorthogonal_lines(X3,X2)
| unorthogonal_lines(X3,X1)
| ~ convergent_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_28,negated_conjecture,
( apart_point_and_line(intersection_point(esk1_0,esk2_0),esk3_0)
| convergent_lines(esk4_0,X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
fof(c_0_29,plain,
! [X10,X11] : ~ unorthogonal_lines(orthogonal_through_point(X11,X10),X11),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[ooc1])]) ).
cnf(c_0_30,negated_conjecture,
( unorthogonal_lines(X1,esk4_0)
| unorthogonal_lines(X1,X2)
| apart_point_and_line(intersection_point(esk1_0,esk2_0),esk3_0) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_31,plain,
~ unorthogonal_lines(orthogonal_through_point(X1,X2),X1),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_32,negated_conjecture,
( unorthogonal_lines(X1,esk4_0)
| apart_point_and_line(intersection_point(esk1_0,esk2_0),esk3_0) ),
inference(ef,[status(thm)],[c_0_30]) ).
cnf(c_0_33,negated_conjecture,
apart_point_and_line(intersection_point(esk1_0,esk2_0),esk3_0),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_34,negated_conjecture,
( apart_point_and_line(intersection_point(esk1_0,esk2_0),X1)
| distinct_lines(esk3_0,X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_33]) ).
cnf(c_0_35,negated_conjecture,
( apart_point_and_line(intersection_point(esk1_0,esk2_0),X1)
| convergent_lines(esk3_0,X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_34]) ).
cnf(c_0_36,negated_conjecture,
convergent_lines(esk3_0,parallel_through_point(X1,intersection_point(esk1_0,esk2_0))),
inference(spm,[status(thm)],[c_0_19,c_0_35]) ).
fof(c_0_37,plain,
! [X2] : ~ convergent_lines(X2,X2),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[apart3])]) ).
cnf(c_0_38,negated_conjecture,
( convergent_lines(parallel_through_point(X1,intersection_point(esk1_0,esk2_0)),X2)
| convergent_lines(esk3_0,X2) ),
inference(spm,[status(thm)],[c_0_22,c_0_36]) ).
cnf(c_0_39,plain,
~ convergent_lines(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_40,negated_conjecture,
convergent_lines(esk3_0,X1),
inference(spm,[status(thm)],[c_0_25,c_0_38]) ).
cnf(c_0_41,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_39,c_0_40]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GEO191+3 : TPTP v8.1.0. Released v4.0.0.
% 0.13/0.13 % Command : run_ET %s %d
% 0.14/0.34 % Computer : n013.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Sat Jun 18 06:01:14 EDT 2022
% 0.20/0.34 % 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.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 : 42
% 0.25/1.42 # Proof object clause steps : 23
% 0.25/1.42 # Proof object formula steps : 19
% 0.25/1.42 # Proof object conjectures : 18
% 0.25/1.42 # Proof object clause conjectures : 15
% 0.25/1.42 # Proof object formula conjectures : 3
% 0.25/1.42 # Proof object initial clauses used : 9
% 0.25/1.42 # Proof object initial formulas used : 9
% 0.25/1.42 # Proof object generating inferences : 14
% 0.25/1.42 # Proof object simplifying inferences : 0
% 0.25/1.42 # Training examples: 0 positive, 0 negative
% 0.25/1.42 # Parsed axioms : 36
% 0.25/1.42 # Removed by relevancy pruning/SinE : 5
% 0.25/1.42 # Initial clauses : 41
% 0.25/1.42 # Removed in clause preprocessing : 0
% 0.25/1.42 # Initial clauses in saturation : 41
% 0.25/1.42 # Processed clauses : 1860
% 0.25/1.42 # ...of these trivial : 17
% 0.25/1.42 # ...subsumed : 795
% 0.25/1.42 # ...remaining for further processing : 1048
% 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 : 247
% 0.25/1.42 # Backward-rewritten : 250
% 0.25/1.42 # Generated clauses : 49035
% 0.25/1.42 # ...of the previous two non-trivial : 43510
% 0.25/1.42 # Contextual simplify-reflections : 401
% 0.25/1.42 # Paramodulations : 48403
% 0.25/1.42 # Factorizations : 632
% 0.25/1.42 # Equation resolutions : 0
% 0.25/1.42 # Current number of processed clauses : 551
% 0.25/1.42 # Positive orientable unit clauses : 45
% 0.25/1.42 # Positive unorientable unit clauses: 0
% 0.25/1.42 # Negative unit clauses : 9
% 0.25/1.42 # Non-unit-clauses : 497
% 0.25/1.42 # Current number of unprocessed clauses: 21282
% 0.25/1.42 # ...number of literals in the above : 135700
% 0.25/1.42 # Current number of archived formulas : 0
% 0.25/1.42 # Current number of archived clauses : 497
% 0.25/1.42 # Clause-clause subsumption calls (NU) : 274826
% 0.25/1.42 # Rec. Clause-clause subsumption calls : 47814
% 0.25/1.42 # Non-unit clause-clause subsumptions : 1320
% 0.25/1.42 # Unit Clause-clause subsumption calls : 8626
% 0.25/1.42 # Rewrite failures with RHS unbound : 0
% 0.25/1.42 # BW rewrite match attempts : 44
% 0.25/1.42 # BW rewrite match successes : 43
% 0.25/1.42 # Condensation attempts : 0
% 0.25/1.42 # Condensation successes : 0
% 0.25/1.42 # Termbank termtop insertions : 828179
% 0.25/1.42
% 0.25/1.42 # -------------------------------------------------
% 0.25/1.42 # User time : 0.870 s
% 0.25/1.42 # System time : 0.015 s
% 0.25/1.42 # Total time : 0.885 s
% 0.25/1.42 # Maximum resident set size: 31556 pages
% 0.25/23.42 eprover: CPU time limit exceeded, terminating
% 0.25/23.43 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.43 eprover: No such file or directory
% 0.25/23.43 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.43 eprover: No such file or directory
% 0.25/23.43 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.43 eprover: No such file or directory
% 0.25/23.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.44 eprover: No such file or directory
% 0.25/23.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.44 eprover: No such file or directory
% 0.25/23.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.44 eprover: No such file or directory
% 0.25/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.45 eprover: No such file or directory
% 0.25/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.45 eprover: No such file or directory
% 0.25/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.45 eprover: No such file or directory
% 0.25/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.46 eprover: No such file or directory
% 0.25/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.46 eprover: No such file or directory
%------------------------------------------------------------------------------