TSTP Solution File: GEO203+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : GEO203+1 : TPTP v8.2.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n004.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 : Mon May 20 19:58:33 EDT 2024
% Result : Theorem 0.60s 0.58s
% Output : CNFRefutation 0.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of formulae : 28 ( 6 unt; 0 def)
% Number of atoms : 74 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 72 ( 26 ~; 29 |; 8 &)
% ( 0 <=>; 9 =>; 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 : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 44 ( 0 sgn 32 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(con,conjecture,
! [X1,X2,X3] :
( ( convergent_lines(X1,X2)
& convergent_lines(X1,X3)
& distinct_points(intersection_point(X1,X2),intersection_point(X1,X3)) )
=> ~ distinct_lines(line_connecting(intersection_point(X1,X2),intersection_point(X1,X3)),X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).
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/sandbox2/benchmark/Axioms/GEO006+0.ax',cu1) ).
fof(ci2,axiom,
! [X1,X2] :
( distinct_points(X1,X2)
=> ~ apart_point_and_line(X2,line_connecting(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+0.ax',ci2) ).
fof(ci1,axiom,
! [X1,X2] :
( distinct_points(X1,X2)
=> ~ apart_point_and_line(X1,line_connecting(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+0.ax',ci1) ).
fof(ci3,axiom,
! [X1,X2] :
( convergent_lines(X1,X2)
=> ~ apart_point_and_line(intersection_point(X1,X2),X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+0.ax',ci3) ).
fof(c_0_5,negated_conjecture,
~ ! [X1,X2,X3] :
( ( convergent_lines(X1,X2)
& convergent_lines(X1,X3)
& distinct_points(intersection_point(X1,X2),intersection_point(X1,X3)) )
=> ~ distinct_lines(line_connecting(intersection_point(X1,X2),intersection_point(X1,X3)),X1) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[con])]) ).
fof(c_0_6,plain,
! [X26,X27,X28,X29] :
( ~ distinct_points(X26,X27)
| ~ distinct_lines(X28,X29)
| apart_point_and_line(X26,X28)
| apart_point_and_line(X26,X29)
| apart_point_and_line(X27,X28)
| apart_point_and_line(X27,X29) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cu1])])]) ).
fof(c_0_7,negated_conjecture,
( convergent_lines(esk1_0,esk2_0)
& convergent_lines(esk1_0,esk3_0)
& distinct_points(intersection_point(esk1_0,esk2_0),intersection_point(esk1_0,esk3_0))
& distinct_lines(line_connecting(intersection_point(esk1_0,esk2_0),intersection_point(esk1_0,esk3_0)),esk1_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
fof(c_0_8,plain,
! [X1,X2] :
( distinct_points(X1,X2)
=> ~ apart_point_and_line(X2,line_connecting(X1,X2)) ),
inference(fof_simplification,[status(thm)],[ci2]) ).
cnf(c_0_9,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_6]) ).
cnf(c_0_10,negated_conjecture,
distinct_lines(line_connecting(intersection_point(esk1_0,esk2_0),intersection_point(esk1_0,esk3_0)),esk1_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_11,plain,
! [X1,X2] :
( distinct_points(X1,X2)
=> ~ apart_point_and_line(X1,line_connecting(X1,X2)) ),
inference(fof_simplification,[status(thm)],[ci1]) ).
fof(c_0_12,plain,
! [X20,X21] :
( ~ distinct_points(X20,X21)
| ~ apart_point_and_line(X21,line_connecting(X20,X21)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])]) ).
cnf(c_0_13,negated_conjecture,
( apart_point_and_line(X1,line_connecting(intersection_point(esk1_0,esk2_0),intersection_point(esk1_0,esk3_0)))
| apart_point_and_line(X2,line_connecting(intersection_point(esk1_0,esk2_0),intersection_point(esk1_0,esk3_0)))
| apart_point_and_line(X1,esk1_0)
| apart_point_and_line(X2,esk1_0)
| ~ distinct_points(X1,X2) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,negated_conjecture,
distinct_points(intersection_point(esk1_0,esk2_0),intersection_point(esk1_0,esk3_0)),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_15,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_16,plain,
! [X18,X19] :
( ~ distinct_points(X18,X19)
| ~ apart_point_and_line(X18,line_connecting(X18,X19)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])]) ).
cnf(c_0_17,plain,
( ~ distinct_points(X1,X2)
| ~ apart_point_and_line(X2,line_connecting(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,negated_conjecture,
( apart_point_and_line(intersection_point(esk1_0,esk3_0),line_connecting(intersection_point(esk1_0,esk2_0),intersection_point(esk1_0,esk3_0)))
| apart_point_and_line(intersection_point(esk1_0,esk2_0),line_connecting(intersection_point(esk1_0,esk2_0),intersection_point(esk1_0,esk3_0)))
| apart_point_and_line(intersection_point(esk1_0,esk3_0),esk1_0)
| apart_point_and_line(intersection_point(esk1_0,esk2_0),esk1_0) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
fof(c_0_19,plain,
! [X22,X23] :
( ~ convergent_lines(X22,X23)
| ~ apart_point_and_line(intersection_point(X22,X23),X22) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_15])])]) ).
cnf(c_0_20,plain,
( ~ distinct_points(X1,X2)
| ~ apart_point_and_line(X1,line_connecting(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_21,negated_conjecture,
( apart_point_and_line(intersection_point(esk1_0,esk2_0),line_connecting(intersection_point(esk1_0,esk2_0),intersection_point(esk1_0,esk3_0)))
| apart_point_and_line(intersection_point(esk1_0,esk2_0),esk1_0)
| apart_point_and_line(intersection_point(esk1_0,esk3_0),esk1_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_14])]) ).
cnf(c_0_22,plain,
( ~ convergent_lines(X1,X2)
| ~ apart_point_and_line(intersection_point(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_23,negated_conjecture,
( apart_point_and_line(intersection_point(esk1_0,esk3_0),esk1_0)
| apart_point_and_line(intersection_point(esk1_0,esk2_0),esk1_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_14])]) ).
cnf(c_0_24,negated_conjecture,
convergent_lines(esk1_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_25,negated_conjecture,
apart_point_and_line(intersection_point(esk1_0,esk2_0),esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24])]) ).
cnf(c_0_26,negated_conjecture,
convergent_lines(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_27,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_25]),c_0_26])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : GEO203+1 : TPTP v8.2.0. Released v3.3.0.
% 0.14/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n004.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Sun May 19 14:28:53 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.21/0.51 Running first-order theorem proving
% 0.21/0.51 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.60/0.58 # Version: 3.1.0
% 0.60/0.58 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.60/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.60/0.58 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.60/0.58 # Starting new_bool_3 with 300s (1) cores
% 0.60/0.58 # Starting new_bool_1 with 300s (1) cores
% 0.60/0.58 # Starting sh5l with 300s (1) cores
% 0.60/0.58 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3066 completed with status 0
% 0.60/0.58 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.60/0.58 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.60/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.60/0.58 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.60/0.58 # No SInE strategy applied
% 0.60/0.58 # Search class: FGHNF-FFSS22-SFFFFFNN
% 0.60/0.58 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.60/0.58 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.60/0.58 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.60/0.58 # Starting new_bool_3 with 136s (1) cores
% 0.60/0.58 # Starting new_bool_1 with 136s (1) cores
% 0.60/0.58 # Starting sh5l with 136s (1) cores
% 0.60/0.58 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3072 completed with status 0
% 0.60/0.58 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.60/0.58 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.60/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.60/0.58 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.60/0.58 # No SInE strategy applied
% 0.60/0.58 # Search class: FGHNF-FFSS22-SFFFFFNN
% 0.60/0.58 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.60/0.58 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.60/0.58 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.60/0.58 # Preprocessing time : 0.001 s
% 0.60/0.58 # Presaturation interreduction done
% 0.60/0.58
% 0.60/0.58 # Proof found!
% 0.60/0.58 # SZS status Theorem
% 0.60/0.58 # SZS output start CNFRefutation
% See solution above
% 0.60/0.58 # Parsed axioms : 15
% 0.60/0.58 # Removed by relevancy pruning/SinE : 0
% 0.60/0.58 # Initial clauses : 18
% 0.60/0.58 # Removed in clause preprocessing : 0
% 0.60/0.58 # Initial clauses in saturation : 18
% 0.60/0.58 # Processed clauses : 591
% 0.60/0.58 # ...of these trivial : 2
% 0.60/0.58 # ...subsumed : 351
% 0.60/0.58 # ...remaining for further processing : 238
% 0.60/0.58 # Other redundant clauses eliminated : 0
% 0.60/0.58 # Clauses deleted for lack of memory : 0
% 0.60/0.58 # Backward-subsumed : 24
% 0.60/0.58 # Backward-rewritten : 4
% 0.60/0.58 # Generated clauses : 1971
% 0.60/0.58 # ...of the previous two non-redundant : 1752
% 0.60/0.58 # ...aggressively subsumed : 0
% 0.60/0.58 # Contextual simplify-reflections : 0
% 0.60/0.58 # Paramodulations : 1659
% 0.60/0.58 # Factorizations : 312
% 0.60/0.58 # NegExts : 0
% 0.60/0.58 # Equation resolutions : 0
% 0.60/0.58 # Disequality decompositions : 0
% 0.60/0.58 # Total rewrite steps : 235
% 0.60/0.58 # ...of those cached : 219
% 0.60/0.58 # Propositional unsat checks : 0
% 0.60/0.58 # Propositional check models : 0
% 0.60/0.58 # Propositional check unsatisfiable : 0
% 0.60/0.58 # Propositional clauses : 0
% 0.60/0.58 # Propositional clauses after purity: 0
% 0.60/0.58 # Propositional unsat core size : 0
% 0.60/0.58 # Propositional preprocessing time : 0.000
% 0.60/0.58 # Propositional encoding time : 0.000
% 0.60/0.58 # Propositional solver time : 0.000
% 0.60/0.58 # Success case prop preproc time : 0.000
% 0.60/0.58 # Success case prop encoding time : 0.000
% 0.60/0.58 # Success case prop solver time : 0.000
% 0.60/0.58 # Current number of processed clauses : 192
% 0.60/0.58 # Positive orientable unit clauses : 17
% 0.60/0.58 # Positive unorientable unit clauses: 0
% 0.60/0.58 # Negative unit clauses : 3
% 0.60/0.58 # Non-unit-clauses : 172
% 0.60/0.58 # Current number of unprocessed clauses: 1161
% 0.60/0.58 # ...number of literals in the above : 7537
% 0.60/0.58 # Current number of archived formulas : 0
% 0.60/0.58 # Current number of archived clauses : 46
% 0.60/0.58 # Clause-clause subsumption calls (NU) : 6555
% 0.60/0.58 # Rec. Clause-clause subsumption calls : 2408
% 0.60/0.58 # Non-unit clause-clause subsumptions : 365
% 0.60/0.58 # Unit Clause-clause subsumption calls : 155
% 0.60/0.58 # Rewrite failures with RHS unbound : 0
% 0.60/0.58 # BW rewrite match attempts : 7
% 0.60/0.58 # BW rewrite match successes : 6
% 0.60/0.58 # Condensation attempts : 0
% 0.60/0.58 # Condensation successes : 0
% 0.60/0.58 # Termbank termtop insertions : 29506
% 0.60/0.58 # Search garbage collected termcells : 208
% 0.60/0.58
% 0.60/0.58 # -------------------------------------------------
% 0.60/0.58 # User time : 0.057 s
% 0.60/0.58 # System time : 0.001 s
% 0.60/0.58 # Total time : 0.058 s
% 0.60/0.58 # Maximum resident set size: 1740 pages
% 0.60/0.58
% 0.60/0.58 # -------------------------------------------------
% 0.60/0.58 # User time : 0.249 s
% 0.60/0.58 # System time : 0.007 s
% 0.60/0.58 # Total time : 0.256 s
% 0.60/0.58 # Maximum resident set size: 1712 pages
% 0.60/0.58 % E---3.1 exiting
% 0.60/0.58 % E exiting
%------------------------------------------------------------------------------