TSTP Solution File: GEO175+3 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : GEO175+3 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n026.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 : 300s
% DateTime : Sat May 4 07:42:03 EDT 2024
% Result : Theorem 0.37s 0.56s
% Output : CNFRefutation 0.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 8
% Syntax : Number of formulae : 44 ( 16 unt; 0 def)
% Number of atoms : 104 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 94 ( 34 ~; 42 |; 9 &)
% ( 0 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 78 ( 3 sgn 49 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(con,conjecture,
! [X1,X2,X4,X5] :
( ( distinct_points(X1,X2)
& convergent_lines(X4,X5)
& distinct_points(X1,intersection_point(X4,X5)) )
=> ( apart_point_and_line(X1,X4)
| apart_point_and_line(X1,X5) ) ),
file('/export/starexec/sandbox/tmp/tmp.pa8H3fTNUh/E---3.1_27697.p',con) ).
fof(ax6,axiom,
! [X1,X2,X3] :
( convergent_lines(X1,X2)
=> ( convergent_lines(X1,X3)
| convergent_lines(X2,X3) ) ),
file('/export/starexec/sandbox/tmp/tmp.pa8H3fTNUh/E---3.1_27697.p',ax6) ).
fof(apart3,axiom,
! [X1] : ~ convergent_lines(X1,X1),
file('/export/starexec/sandbox/tmp/tmp.pa8H3fTNUh/E---3.1_27697.p',apart3) ).
fof(cp1,axiom,
! [X1,X2] : ~ convergent_lines(parallel_through_point(X2,X1),X2),
file('/export/starexec/sandbox/tmp/tmp.pa8H3fTNUh/E---3.1_27697.p',cp1) ).
fof(ceq3,axiom,
! [X1,X2,X3] :
( convergent_lines(X1,X2)
=> ( distinct_lines(X2,X3)
| convergent_lines(X1,X3) ) ),
file('/export/starexec/sandbox/tmp/tmp.pa8H3fTNUh/E---3.1_27697.p',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/tmp/tmp.pa8H3fTNUh/E---3.1_27697.p',cu1) ).
fof(ci4,axiom,
! [X1,X2] :
( convergent_lines(X1,X2)
=> ~ apart_point_and_line(intersection_point(X1,X2),X2) ),
file('/export/starexec/sandbox/tmp/tmp.pa8H3fTNUh/E---3.1_27697.p',ci4) ).
fof(ci3,axiom,
! [X1,X2] :
( convergent_lines(X1,X2)
=> ~ apart_point_and_line(intersection_point(X1,X2),X1) ),
file('/export/starexec/sandbox/tmp/tmp.pa8H3fTNUh/E---3.1_27697.p',ci3) ).
fof(c_0_8,negated_conjecture,
~ ! [X1,X2,X4,X5] :
( ( distinct_points(X1,X2)
& convergent_lines(X4,X5)
& distinct_points(X1,intersection_point(X4,X5)) )
=> ( apart_point_and_line(X1,X4)
| apart_point_and_line(X1,X5) ) ),
inference(assume_negation,[status(cth)],[con]) ).
fof(c_0_9,plain,
! [X20,X21,X22] :
( ~ convergent_lines(X20,X21)
| convergent_lines(X20,X22)
| convergent_lines(X21,X22) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax6])])]) ).
fof(c_0_10,negated_conjecture,
( distinct_points(esk1_0,esk2_0)
& convergent_lines(esk3_0,esk4_0)
& distinct_points(esk1_0,intersection_point(esk3_0,esk4_0))
& ~ apart_point_and_line(esk1_0,esk3_0)
& ~ apart_point_and_line(esk1_0,esk4_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])]) ).
fof(c_0_11,plain,
! [X1] : ~ convergent_lines(X1,X1),
inference(fof_simplification,[status(thm)],[apart3]) ).
cnf(c_0_12,plain,
( convergent_lines(X1,X3)
| convergent_lines(X2,X3)
| ~ convergent_lines(X1,X2) ),
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,
! [X13] : ~ convergent_lines(X13,X13),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_11])]) ).
cnf(c_0_15,negated_conjecture,
( convergent_lines(esk3_0,X1)
| convergent_lines(esk4_0,X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,plain,
~ convergent_lines(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_17,negated_conjecture,
( convergent_lines(esk3_0,X1)
| convergent_lines(esk4_0,X2)
| convergent_lines(X1,X2) ),
inference(spm,[status(thm)],[c_0_12,c_0_15]) ).
fof(c_0_18,plain,
! [X1,X2] : ~ convergent_lines(parallel_through_point(X2,X1),X2),
inference(fof_simplification,[status(thm)],[cp1]) ).
cnf(c_0_19,negated_conjecture,
( convergent_lines(X1,esk4_0)
| convergent_lines(esk3_0,X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
fof(c_0_20,plain,
! [X46,X47] : ~ convergent_lines(parallel_through_point(X47,X46),X47),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_18])]) ).
cnf(c_0_21,negated_conjecture,
( convergent_lines(X1,esk4_0)
| convergent_lines(esk3_0,X2)
| convergent_lines(X1,X2) ),
inference(spm,[status(thm)],[c_0_12,c_0_19]) ).
fof(c_0_22,plain,
! [X41,X42,X43] :
( ~ convergent_lines(X41,X42)
| distinct_lines(X42,X43)
| convergent_lines(X41,X43) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ceq3])])]) ).
cnf(c_0_23,plain,
~ convergent_lines(parallel_through_point(X1,X2),X1),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_24,negated_conjecture,
( convergent_lines(X1,esk3_0)
| convergent_lines(X1,esk4_0) ),
inference(spm,[status(thm)],[c_0_16,c_0_21]) ).
cnf(c_0_25,plain,
( distinct_lines(X2,X3)
| convergent_lines(X1,X3)
| ~ convergent_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_26,negated_conjecture,
convergent_lines(parallel_through_point(esk4_0,X1),esk3_0),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
fof(c_0_27,plain,
! [X31,X32,X33,X34] :
( ~ distinct_points(X31,X32)
| ~ distinct_lines(X33,X34)
| apart_point_and_line(X31,X33)
| apart_point_and_line(X31,X34)
| apart_point_and_line(X32,X33)
| apart_point_and_line(X32,X34) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cu1])])]) ).
cnf(c_0_28,negated_conjecture,
( convergent_lines(parallel_through_point(esk4_0,X1),X2)
| distinct_lines(esk3_0,X2) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
fof(c_0_29,plain,
! [X1,X2] :
( convergent_lines(X1,X2)
=> ~ apart_point_and_line(intersection_point(X1,X2),X2) ),
inference(fof_simplification,[status(thm)],[ci4]) ).
cnf(c_0_30,plain,
( apart_point_and_line(X1,X3)
| apart_point_and_line(X1,X4)
| apart_point_and_line(X2,X3)
| apart_point_and_line(X2,X4)
| ~ distinct_points(X1,X2)
| ~ distinct_lines(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_31,negated_conjecture,
distinct_lines(esk3_0,esk4_0),
inference(spm,[status(thm)],[c_0_23,c_0_28]) ).
fof(c_0_32,plain,
! [X1,X2] :
( convergent_lines(X1,X2)
=> ~ apart_point_and_line(intersection_point(X1,X2),X1) ),
inference(fof_simplification,[status(thm)],[ci3]) ).
fof(c_0_33,plain,
! [X29,X30] :
( ~ convergent_lines(X29,X30)
| ~ apart_point_and_line(intersection_point(X29,X30),X30) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_29])])]) ).
cnf(c_0_34,negated_conjecture,
( apart_point_and_line(X1,esk3_0)
| apart_point_and_line(X1,esk4_0)
| apart_point_and_line(X2,esk3_0)
| apart_point_and_line(X2,esk4_0)
| ~ distinct_points(X1,X2) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_35,negated_conjecture,
distinct_points(esk1_0,intersection_point(esk3_0,esk4_0)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_36,negated_conjecture,
~ apart_point_and_line(esk1_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_37,negated_conjecture,
~ apart_point_and_line(esk1_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_38,plain,
! [X27,X28] :
( ~ convergent_lines(X27,X28)
| ~ apart_point_and_line(intersection_point(X27,X28),X27) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_32])])]) ).
cnf(c_0_39,plain,
( ~ convergent_lines(X1,X2)
| ~ apart_point_and_line(intersection_point(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_40,negated_conjecture,
( apart_point_and_line(intersection_point(esk3_0,esk4_0),esk4_0)
| apart_point_and_line(intersection_point(esk3_0,esk4_0),esk3_0) ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]),c_0_37]) ).
cnf(c_0_41,plain,
( ~ convergent_lines(X1,X2)
| ~ apart_point_and_line(intersection_point(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_42,negated_conjecture,
apart_point_and_line(intersection_point(esk3_0,esk4_0),esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_13])]) ).
cnf(c_0_43,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_13])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : GEO175+3 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.15 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n026.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Fri May 3 18:44:38 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.21/0.52 Running first-order theorem proving
% 0.21/0.52 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.pa8H3fTNUh/E---3.1_27697.p
% 0.37/0.56 # Version: 3.1.0
% 0.37/0.56 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.37/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.37/0.56 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.37/0.56 # Starting new_bool_3 with 300s (1) cores
% 0.37/0.56 # Starting new_bool_1 with 300s (1) cores
% 0.37/0.56 # Starting sh5l with 300s (1) cores
% 0.37/0.56 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 27784 completed with status 0
% 0.37/0.56 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.37/0.56 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.37/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.37/0.56 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.37/0.56 # No SInE strategy applied
% 0.37/0.56 # Search class: FGHNF-FFMS22-SFFFFFNN
% 0.37/0.56 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.37/0.56 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.37/0.56 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.37/0.56 # Starting new_bool_3 with 136s (1) cores
% 0.37/0.56 # Starting new_bool_1 with 136s (1) cores
% 0.37/0.56 # Starting sh5l with 136s (1) cores
% 0.37/0.56 # SAT001_MinMin_p005000_rr_RG with pid 27789 completed with status 0
% 0.37/0.56 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.37/0.56 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.37/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.37/0.56 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.37/0.56 # No SInE strategy applied
% 0.37/0.56 # Search class: FGHNF-FFMS22-SFFFFFNN
% 0.37/0.56 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.37/0.56 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.37/0.56 # Preprocessing time : 0.002 s
% 0.37/0.56 # Presaturation interreduction done
% 0.37/0.56
% 0.37/0.56 # Proof found!
% 0.37/0.56 # SZS status Theorem
% 0.37/0.56 # SZS output start CNFRefutation
% See solution above
% 0.37/0.56 # Parsed axioms : 36
% 0.37/0.56 # Removed by relevancy pruning/SinE : 0
% 0.37/0.56 # Initial clauses : 51
% 0.37/0.56 # Removed in clause preprocessing : 0
% 0.37/0.56 # Initial clauses in saturation : 51
% 0.37/0.56 # Processed clauses : 223
% 0.37/0.56 # ...of these trivial : 0
% 0.37/0.56 # ...subsumed : 53
% 0.37/0.56 # ...remaining for further processing : 170
% 0.37/0.56 # Other redundant clauses eliminated : 0
% 0.37/0.56 # Clauses deleted for lack of memory : 0
% 0.37/0.56 # Backward-subsumed : 0
% 0.37/0.56 # Backward-rewritten : 1
% 0.37/0.56 # Generated clauses : 526
% 0.37/0.56 # ...of the previous two non-redundant : 426
% 0.37/0.56 # ...aggressively subsumed : 0
% 0.37/0.56 # Contextual simplify-reflections : 0
% 0.37/0.56 # Paramodulations : 474
% 0.37/0.56 # Factorizations : 52
% 0.37/0.56 # NegExts : 0
% 0.37/0.56 # Equation resolutions : 0
% 0.37/0.56 # Disequality decompositions : 0
% 0.37/0.56 # Total rewrite steps : 91
% 0.37/0.56 # ...of those cached : 77
% 0.37/0.56 # Propositional unsat checks : 0
% 0.37/0.56 # Propositional check models : 0
% 0.37/0.56 # Propositional check unsatisfiable : 0
% 0.37/0.56 # Propositional clauses : 0
% 0.37/0.56 # Propositional clauses after purity: 0
% 0.37/0.56 # Propositional unsat core size : 0
% 0.37/0.56 # Propositional preprocessing time : 0.000
% 0.37/0.56 # Propositional encoding time : 0.000
% 0.37/0.56 # Propositional solver time : 0.000
% 0.37/0.56 # Success case prop preproc time : 0.000
% 0.37/0.56 # Success case prop encoding time : 0.000
% 0.37/0.56 # Success case prop solver time : 0.000
% 0.37/0.56 # Current number of processed clauses : 122
% 0.37/0.56 # Positive orientable unit clauses : 18
% 0.37/0.56 # Positive unorientable unit clauses: 0
% 0.37/0.56 # Negative unit clauses : 9
% 0.37/0.56 # Non-unit-clauses : 95
% 0.37/0.56 # Current number of unprocessed clauses: 299
% 0.37/0.56 # ...number of literals in the above : 1235
% 0.37/0.56 # Current number of archived formulas : 0
% 0.37/0.56 # Current number of archived clauses : 48
% 0.37/0.56 # Clause-clause subsumption calls (NU) : 2002
% 0.37/0.56 # Rec. Clause-clause subsumption calls : 1083
% 0.37/0.56 # Non-unit clause-clause subsumptions : 53
% 0.37/0.56 # Unit Clause-clause subsumption calls : 128
% 0.37/0.56 # Rewrite failures with RHS unbound : 0
% 0.37/0.56 # BW rewrite match attempts : 1
% 0.37/0.56 # BW rewrite match successes : 1
% 0.37/0.56 # Condensation attempts : 0
% 0.37/0.56 # Condensation successes : 0
% 0.37/0.56 # Termbank termtop insertions : 9220
% 0.37/0.56 # Search garbage collected termcells : 521
% 0.37/0.56
% 0.37/0.56 # -------------------------------------------------
% 0.37/0.56 # User time : 0.018 s
% 0.37/0.56 # System time : 0.005 s
% 0.37/0.56 # Total time : 0.023 s
% 0.37/0.56 # Maximum resident set size: 1868 pages
% 0.37/0.56
% 0.37/0.56 # -------------------------------------------------
% 0.37/0.56 # User time : 0.083 s
% 0.37/0.56 # System time : 0.009 s
% 0.37/0.56 # Total time : 0.092 s
% 0.37/0.56 # Maximum resident set size: 1752 pages
% 0.37/0.56 % E---3.1 exiting
% 0.37/0.56 % E exiting
%------------------------------------------------------------------------------