%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : GEO186+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:04:26 EDT 2022
% Result : Theorem 0.23s 1.39s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of formulae : 36 ( 11 unt; 0 def)
% Number of atoms : 96 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 93 ( 33 ~; 39 |; 13 &)
% ( 2 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 66 ( 4 sgn 44 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(con,conjecture,
! [X1,X2,X4,X5] :
( ( distinct_points(X1,X2)
& convergent_lines(X4,X5)
& incident_point_and_line(X1,X4)
& incident_point_and_line(X1,X5) )
=> equal_points(X1,intersection_point(X4,X5)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',con) ).
fof(ceq3,axiom,
! [X1,X2,X3] :
( convergent_lines(X1,X2)
=> ( distinct_lines(X2,X3)
| convergent_lines(X1,X3) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+0.ax',ceq3) ).
fof(cu1,axiom,
! [X1,X2,X4,X5] :
( ( distinct_points(X1,X2)
& distinct_lines(X4,X5) )
=> ( apart_point_and_line(X1,X4)
| apart_point_and_line(X1,X5)
| apart_point_and_line(X2,X4)
| apart_point_and_line(X2,X5) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+0.ax',cu1) ).
fof(ax1,axiom,
! [X1,X2] :
( equal_points(X1,X2)
<=> ~ distinct_points(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+6.ax',ax1) ).
fof(a4,axiom,
! [X1,X2] :
( incident_point_and_line(X1,X2)
<=> ~ apart_point_and_line(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+6.ax',a4) ).
fof(ci4,axiom,
! [X1,X2] :
( convergent_lines(X1,X2)
=> ~ apart_point_and_line(intersection_point(X1,X2),X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+0.ax',ci4) ).
fof(ci3,axiom,
! [X1,X2] :
( convergent_lines(X1,X2)
=> ~ apart_point_and_line(intersection_point(X1,X2),X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+0.ax',ci3) ).
fof(apart3,axiom,
! [X1] : ~ convergent_lines(X1,X1),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+0.ax',apart3) ).
fof(c_0_8,negated_conjecture,
~ ! [X1,X2,X4,X5] :
( ( distinct_points(X1,X2)
& convergent_lines(X4,X5)
& incident_point_and_line(X1,X4)
& incident_point_and_line(X1,X5) )
=> equal_points(X1,intersection_point(X4,X5)) ),
inference(assume_negation,[status(cth)],[con]) ).
fof(c_0_9,plain,
! [X4,X5,X6] :
( ~ convergent_lines(X4,X5)
| distinct_lines(X5,X6)
| convergent_lines(X4,X6) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ceq3])])])]) ).
fof(c_0_10,negated_conjecture,
( distinct_points(esk1_0,esk2_0)
& convergent_lines(esk3_0,esk4_0)
& incident_point_and_line(esk1_0,esk3_0)
& incident_point_and_line(esk1_0,esk4_0)
& ~ equal_points(esk1_0,intersection_point(esk3_0,esk4_0)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])]) ).
fof(c_0_11,plain,
! [X6,X7,X8,X9] :
( ~ distinct_points(X6,X7)
| ~ distinct_lines(X8,X9)
| apart_point_and_line(X6,X8)
| apart_point_and_line(X6,X9)
| apart_point_and_line(X7,X8)
| apart_point_and_line(X7,X9) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cu1])]) ).
cnf(c_0_12,plain,
( convergent_lines(X1,X2)
| distinct_lines(X3,X2)
| ~ convergent_lines(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,negated_conjecture,
convergent_lines(esk3_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_14,plain,
! [X3,X4,X3,X4] :
( ( ~ equal_points(X3,X4)
| ~ distinct_points(X3,X4) )
& ( distinct_points(X3,X4)
| equal_points(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)],[ax1])])])])]) ).
fof(c_0_15,plain,
! [X3,X4,X3,X4] :
( ( ~ incident_point_and_line(X3,X4)
| ~ apart_point_and_line(X3,X4) )
& ( apart_point_and_line(X3,X4)
| incident_point_and_line(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])])])])]) ).
cnf(c_0_16,plain,
( apart_point_and_line(X1,X2)
| apart_point_and_line(X1,X3)
| apart_point_and_line(X4,X2)
| apart_point_and_line(X4,X3)
| ~ distinct_lines(X3,X2)
| ~ distinct_points(X4,X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,negated_conjecture,
( convergent_lines(esk3_0,X1)
| distinct_lines(esk4_0,X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_18,negated_conjecture,
~ equal_points(esk1_0,intersection_point(esk3_0,esk4_0)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_19,plain,
( equal_points(X1,X2)
| distinct_points(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,plain,
( ~ apart_point_and_line(X1,X2)
| ~ incident_point_and_line(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_21,negated_conjecture,
incident_point_and_line(esk1_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_22,plain,
! [X3,X4] :
( ~ convergent_lines(X3,X4)
| ~ apart_point_and_line(intersection_point(X3,X4),X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[ci4])])]) ).
cnf(c_0_23,negated_conjecture,
( apart_point_and_line(X1,esk4_0)
| apart_point_and_line(X2,esk4_0)
| apart_point_and_line(X1,X3)
| apart_point_and_line(X2,X3)
| convergent_lines(esk3_0,X3)
| ~ distinct_points(X1,X2) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_24,negated_conjecture,
distinct_points(esk1_0,intersection_point(esk3_0,esk4_0)),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_25,negated_conjecture,
~ apart_point_and_line(esk1_0,esk4_0),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
fof(c_0_26,plain,
! [X3,X4] :
( ~ convergent_lines(X3,X4)
| ~ apart_point_and_line(intersection_point(X3,X4),X3) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[ci3])])]) ).
cnf(c_0_27,plain,
( ~ apart_point_and_line(intersection_point(X1,X2),X2)
| ~ convergent_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_28,negated_conjecture,
( apart_point_and_line(intersection_point(esk3_0,esk4_0),esk4_0)
| apart_point_and_line(intersection_point(esk3_0,esk4_0),X1)
| apart_point_and_line(esk1_0,X1)
| convergent_lines(esk3_0,X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]) ).
cnf(c_0_29,negated_conjecture,
incident_point_and_line(esk1_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_30,plain,
! [X2] : ~ convergent_lines(X2,X2),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[apart3])]) ).
cnf(c_0_31,plain,
( ~ apart_point_and_line(intersection_point(X1,X2),X1)
| ~ convergent_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_32,negated_conjecture,
( apart_point_and_line(intersection_point(esk3_0,esk4_0),X1)
| apart_point_and_line(esk1_0,X1)
| convergent_lines(esk3_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_13])]) ).
cnf(c_0_33,negated_conjecture,
~ apart_point_and_line(esk1_0,esk3_0),
inference(spm,[status(thm)],[c_0_20,c_0_29]) ).
cnf(c_0_34,plain,
~ convergent_lines(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_35,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_13])]),c_0_33]),c_0_34]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : GEO186+3 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n003.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 : Fri Jun 17 15:33:42 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.23/1.39 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.39 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.39 # Preprocessing time : 0.017 s
% 0.23/1.39
% 0.23/1.39 # Proof found!
% 0.23/1.39 # SZS status Theorem
% 0.23/1.39 # SZS output start CNFRefutation
% See solution above
% 0.23/1.39 # Proof object total steps : 36
% 0.23/1.39 # Proof object clause steps : 19
% 0.23/1.39 # Proof object formula steps : 17
% 0.23/1.39 # Proof object conjectures : 15
% 0.23/1.39 # Proof object clause conjectures : 12
% 0.23/1.39 # Proof object formula conjectures : 3
% 0.23/1.39 # Proof object initial clauses used : 11
% 0.23/1.39 # Proof object initial formulas used : 8
% 0.23/1.39 # Proof object generating inferences : 8
% 0.23/1.39 # Proof object simplifying inferences : 7
% 0.23/1.39 # Training examples: 0 positive, 0 negative
% 0.23/1.39 # Parsed axioms : 36
% 0.23/1.39 # Removed by relevancy pruning/SinE : 3
% 0.23/1.39 # Initial clauses : 45
% 0.23/1.39 # Removed in clause preprocessing : 0
% 0.23/1.39 # Initial clauses in saturation : 45
% 0.23/1.39 # Processed clauses : 869
% 0.23/1.39 # ...of these trivial : 4
% 0.23/1.39 # ...subsumed : 471
% 0.23/1.39 # ...remaining for further processing : 394
% 0.23/1.39 # Other redundant clauses eliminated : 0
% 0.23/1.39 # Clauses deleted for lack of memory : 0
% 0.23/1.39 # Backward-subsumed : 25
% 0.23/1.39 # Backward-rewritten : 0
% 0.23/1.39 # Generated clauses : 9094
% 0.23/1.39 # ...of the previous two non-trivial : 8111
% 0.23/1.39 # Contextual simplify-reflections : 326
% 0.23/1.39 # Paramodulations : 8728
% 0.23/1.39 # Factorizations : 366
% 0.23/1.39 # Equation resolutions : 0
% 0.23/1.39 # Current number of processed clauses : 369
% 0.23/1.39 # Positive orientable unit clauses : 25
% 0.23/1.39 # Positive unorientable unit clauses: 0
% 0.23/1.39 # Negative unit clauses : 10
% 0.23/1.39 # Non-unit-clauses : 334
% 0.23/1.39 # Current number of unprocessed clauses: 6777
% 0.23/1.39 # ...number of literals in the above : 36886
% 0.23/1.39 # Current number of archived formulas : 0
% 0.23/1.39 # Current number of archived clauses : 25
% 0.23/1.39 # Clause-clause subsumption calls (NU) : 86633
% 0.23/1.39 # Rec. Clause-clause subsumption calls : 19874
% 0.23/1.39 # Non-unit clause-clause subsumptions : 770
% 0.23/1.39 # Unit Clause-clause subsumption calls : 1424
% 0.23/1.39 # Rewrite failures with RHS unbound : 0
% 0.23/1.39 # BW rewrite match attempts : 5
% 0.23/1.39 # BW rewrite match successes : 5
% 0.23/1.39 # Condensation attempts : 0
% 0.23/1.39 # Condensation successes : 0
% 0.23/1.39 # Termbank termtop insertions : 126387
% 0.23/1.39
% 0.23/1.39 # -------------------------------------------------
% 0.23/1.39 # User time : 0.222 s
% 0.23/1.39 # System time : 0.003 s
% 0.23/1.39 # Total time : 0.225 s
% 0.23/1.39 # Maximum resident set size: 8868 pages
%------------------------------------------------------------------------------