TSTP Solution File: GEO200+3 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GEO200+3 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% 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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 17:32:04 EDT 2023
% Result : Theorem 0.21s 0.54s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 9
% Syntax : Number of formulae : 45 ( 15 unt; 0 def)
% Number of atoms : 101 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 92 ( 36 ~; 42 |; 3 &)
% ( 2 <=>; 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 : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 70 ( 0 sgn; 48 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(con,conjecture,
! [X1,X2] :
( distinct_points(X1,X2)
=> equal_lines(line_connecting(X1,X2),line_connecting(X2,X1)) ),
file('/export/starexec/sandbox/tmp/tmp.IL3kbw4I3M/E---3.1_344.p',con) ).
fof(ax2,axiom,
! [X1,X2] :
( equal_lines(X1,X2)
<=> ~ distinct_lines(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.IL3kbw4I3M/E---3.1_344.p',ax2) ).
fof(apart2,axiom,
! [X1] : ~ distinct_lines(X1,X1),
file('/export/starexec/sandbox/tmp/tmp.IL3kbw4I3M/E---3.1_344.p',apart2) ).
fof(apart5,axiom,
! [X1,X2,X3] :
( distinct_lines(X1,X2)
=> ( distinct_lines(X1,X3)
| distinct_lines(X2,X3) ) ),
file('/export/starexec/sandbox/tmp/tmp.IL3kbw4I3M/E---3.1_344.p',apart5) ).
fof(apart1,axiom,
! [X1] : ~ distinct_points(X1,X1),
file('/export/starexec/sandbox/tmp/tmp.IL3kbw4I3M/E---3.1_344.p',apart1) ).
fof(apart4,axiom,
! [X1,X2,X3] :
( distinct_points(X1,X2)
=> ( distinct_points(X1,X3)
| distinct_points(X2,X3) ) ),
file('/export/starexec/sandbox/tmp/tmp.IL3kbw4I3M/E---3.1_344.p',apart4) ).
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.IL3kbw4I3M/E---3.1_344.p',cu1) ).
fof(ci1,axiom,
! [X1,X2] :
( distinct_points(X1,X2)
=> ~ apart_point_and_line(X1,line_connecting(X1,X2)) ),
file('/export/starexec/sandbox/tmp/tmp.IL3kbw4I3M/E---3.1_344.p',ci1) ).
fof(ci2,axiom,
! [X1,X2] :
( distinct_points(X1,X2)
=> ~ apart_point_and_line(X2,line_connecting(X1,X2)) ),
file('/export/starexec/sandbox/tmp/tmp.IL3kbw4I3M/E---3.1_344.p',ci2) ).
fof(c_0_9,negated_conjecture,
~ ! [X1,X2] :
( distinct_points(X1,X2)
=> equal_lines(line_connecting(X1,X2),line_connecting(X2,X1)) ),
inference(assume_negation,[status(cth)],[con]) ).
fof(c_0_10,plain,
! [X1,X2] :
( equal_lines(X1,X2)
<=> ~ distinct_lines(X1,X2) ),
inference(fof_simplification,[status(thm)],[ax2]) ).
fof(c_0_11,negated_conjecture,
( distinct_points(esk1_0,esk2_0)
& ~ equal_lines(line_connecting(esk1_0,esk2_0),line_connecting(esk2_0,esk1_0)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])]) ).
fof(c_0_12,plain,
! [X84,X85] :
( ( ~ equal_lines(X84,X85)
| ~ distinct_lines(X84,X85) )
& ( distinct_lines(X84,X85)
| equal_lines(X84,X85) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])]) ).
fof(c_0_13,plain,
! [X1] : ~ distinct_lines(X1,X1),
inference(fof_simplification,[status(thm)],[apart2]) ).
fof(c_0_14,plain,
! [X17,X18,X19] :
( ~ distinct_lines(X17,X18)
| distinct_lines(X17,X19)
| distinct_lines(X18,X19) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[apart5])]) ).
cnf(c_0_15,negated_conjecture,
~ equal_lines(line_connecting(esk1_0,esk2_0),line_connecting(esk2_0,esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,plain,
( distinct_lines(X1,X2)
| equal_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_17,plain,
! [X12] : ~ distinct_lines(X12,X12),
inference(variable_rename,[status(thm)],[c_0_13]) ).
cnf(c_0_18,plain,
( distinct_lines(X1,X3)
| distinct_lines(X2,X3)
| ~ distinct_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_19,negated_conjecture,
distinct_lines(line_connecting(esk1_0,esk2_0),line_connecting(esk2_0,esk1_0)),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
fof(c_0_20,plain,
! [X1] : ~ distinct_points(X1,X1),
inference(fof_simplification,[status(thm)],[apart1]) ).
fof(c_0_21,plain,
! [X14,X15,X16] :
( ~ distinct_points(X14,X15)
| distinct_points(X14,X16)
| distinct_points(X15,X16) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[apart4])]) ).
fof(c_0_22,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(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cu1])]) ).
cnf(c_0_23,plain,
~ distinct_lines(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_24,negated_conjecture,
( distinct_lines(line_connecting(esk1_0,esk2_0),X1)
| distinct_lines(line_connecting(esk2_0,esk1_0),X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
fof(c_0_25,plain,
! [X11] : ~ distinct_points(X11,X11),
inference(variable_rename,[status(thm)],[c_0_20]) ).
cnf(c_0_26,plain,
( distinct_points(X1,X3)
| distinct_points(X2,X3)
| ~ distinct_points(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_27,negated_conjecture,
distinct_points(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_28,plain,
! [X1,X2] :
( distinct_points(X1,X2)
=> ~ apart_point_and_line(X1,line_connecting(X1,X2)) ),
inference(fof_simplification,[status(thm)],[ci1]) ).
cnf(c_0_29,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_22]) ).
cnf(c_0_30,negated_conjecture,
distinct_lines(line_connecting(esk2_0,esk1_0),line_connecting(esk1_0,esk2_0)),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_31,plain,
~ distinct_points(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_32,negated_conjecture,
( distinct_points(esk1_0,X1)
| distinct_points(esk2_0,X1) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
fof(c_0_33,plain,
! [X1,X2] :
( distinct_points(X1,X2)
=> ~ apart_point_and_line(X2,line_connecting(X1,X2)) ),
inference(fof_simplification,[status(thm)],[ci2]) ).
fof(c_0_34,plain,
! [X23,X24] :
( ~ distinct_points(X23,X24)
| ~ apart_point_and_line(X23,line_connecting(X23,X24)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_28])]) ).
cnf(c_0_35,negated_conjecture,
( apart_point_and_line(X1,line_connecting(esk2_0,esk1_0))
| apart_point_and_line(X1,line_connecting(esk1_0,esk2_0))
| apart_point_and_line(X2,line_connecting(esk2_0,esk1_0))
| apart_point_and_line(X2,line_connecting(esk1_0,esk2_0))
| ~ distinct_points(X1,X2) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_36,negated_conjecture,
distinct_points(esk2_0,esk1_0),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
fof(c_0_37,plain,
! [X25,X26] :
( ~ distinct_points(X25,X26)
| ~ apart_point_and_line(X26,line_connecting(X25,X26)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_33])]) ).
cnf(c_0_38,plain,
( ~ distinct_points(X1,X2)
| ~ apart_point_and_line(X1,line_connecting(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_39,negated_conjecture,
( apart_point_and_line(esk1_0,line_connecting(esk1_0,esk2_0))
| apart_point_and_line(esk1_0,line_connecting(esk2_0,esk1_0))
| apart_point_and_line(esk2_0,line_connecting(esk1_0,esk2_0))
| apart_point_and_line(esk2_0,line_connecting(esk2_0,esk1_0)) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_40,plain,
( ~ distinct_points(X1,X2)
| ~ apart_point_and_line(X2,line_connecting(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_41,negated_conjecture,
( apart_point_and_line(esk2_0,line_connecting(esk2_0,esk1_0))
| apart_point_and_line(esk2_0,line_connecting(esk1_0,esk2_0))
| apart_point_and_line(esk1_0,line_connecting(esk2_0,esk1_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_27])]) ).
cnf(c_0_42,negated_conjecture,
( apart_point_and_line(esk2_0,line_connecting(esk1_0,esk2_0))
| apart_point_and_line(esk2_0,line_connecting(esk2_0,esk1_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_36])]) ).
cnf(c_0_43,negated_conjecture,
apart_point_and_line(esk2_0,line_connecting(esk2_0,esk1_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_42]),c_0_27])]) ).
cnf(c_0_44,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_43]),c_0_36])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.14 % Problem : GEO200+3 : TPTP v8.1.2. Released v4.0.0.
% 0.03/0.15 % Command : run_E %s %d THM
% 0.15/0.36 % Computer : n003.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 2400
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Tue Oct 3 06:30:33 EDT 2023
% 0.15/0.36 % CPUTime :
% 0.21/0.50 Running first-order theorem proving
% 0.21/0.50 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.IL3kbw4I3M/E---3.1_344.p
% 0.21/0.53 # Version: 3.1pre001
% 0.21/0.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.53 # Starting sh5l with 300s (1) cores
% 0.21/0.53 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 422 completed with status 0
% 0.21/0.53 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.21/0.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.53 # No SInE strategy applied
% 0.21/0.53 # Search class: FGHNF-FFMF22-SFFFFFNN
% 0.21/0.53 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.53 # Starting SAT001_CO_MinMin_p005000_rr with 811s (1) cores
% 0.21/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.21/0.53 # Starting new_bool_3 with 136s (1) cores
% 0.21/0.53 # Starting new_bool_1 with 136s (1) cores
% 0.21/0.53 # Starting sh5l with 136s (1) cores
% 0.21/0.54 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 430 completed with status 0
% 0.21/0.54 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.21/0.54 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.54 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.54 # No SInE strategy applied
% 0.21/0.54 # Search class: FGHNF-FFMF22-SFFFFFNN
% 0.21/0.54 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.54 # Starting SAT001_CO_MinMin_p005000_rr with 811s (1) cores
% 0.21/0.54 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.21/0.54 # Preprocessing time : 0.001 s
% 0.21/0.54 # Presaturation interreduction done
% 0.21/0.54
% 0.21/0.54 # Proof found!
% 0.21/0.54 # SZS status Theorem
% 0.21/0.54 # SZS output start CNFRefutation
% See solution above
% 0.21/0.54 # Parsed axioms : 36
% 0.21/0.54 # Removed by relevancy pruning/SinE : 0
% 0.21/0.54 # Initial clauses : 48
% 0.21/0.54 # Removed in clause preprocessing : 0
% 0.21/0.54 # Initial clauses in saturation : 48
% 0.21/0.54 # Processed clauses : 278
% 0.21/0.54 # ...of these trivial : 4
% 0.21/0.54 # ...subsumed : 100
% 0.21/0.54 # ...remaining for further processing : 174
% 0.21/0.54 # Other redundant clauses eliminated : 0
% 0.21/0.54 # Clauses deleted for lack of memory : 0
% 0.21/0.54 # Backward-subsumed : 6
% 0.21/0.54 # Backward-rewritten : 2
% 0.21/0.54 # Generated clauses : 825
% 0.21/0.54 # ...of the previous two non-redundant : 712
% 0.21/0.54 # ...aggressively subsumed : 0
% 0.21/0.54 # Contextual simplify-reflections : 0
% 0.21/0.54 # Paramodulations : 737
% 0.21/0.54 # Factorizations : 88
% 0.21/0.54 # NegExts : 0
% 0.21/0.54 # Equation resolutions : 0
% 0.21/0.54 # Total rewrite steps : 118
% 0.21/0.54 # Propositional unsat checks : 0
% 0.21/0.54 # Propositional check models : 0
% 0.21/0.54 # Propositional check unsatisfiable : 0
% 0.21/0.54 # Propositional clauses : 0
% 0.21/0.54 # Propositional clauses after purity: 0
% 0.21/0.54 # Propositional unsat core size : 0
% 0.21/0.54 # Propositional preprocessing time : 0.000
% 0.21/0.54 # Propositional encoding time : 0.000
% 0.21/0.54 # Propositional solver time : 0.000
% 0.21/0.54 # Success case prop preproc time : 0.000
% 0.21/0.54 # Success case prop encoding time : 0.000
% 0.21/0.54 # Success case prop solver time : 0.000
% 0.21/0.54 # Current number of processed clauses : 122
% 0.21/0.54 # Positive orientable unit clauses : 17
% 0.21/0.54 # Positive unorientable unit clauses: 0
% 0.21/0.54 # Negative unit clauses : 8
% 0.21/0.54 # Non-unit-clauses : 97
% 0.21/0.54 # Current number of unprocessed clauses: 521
% 0.21/0.54 # ...number of literals in the above : 2517
% 0.21/0.54 # Current number of archived formulas : 0
% 0.21/0.54 # Current number of archived clauses : 52
% 0.21/0.54 # Clause-clause subsumption calls (NU) : 2586
% 0.21/0.54 # Rec. Clause-clause subsumption calls : 1251
% 0.21/0.54 # Non-unit clause-clause subsumptions : 96
% 0.21/0.54 # Unit Clause-clause subsumption calls : 117
% 0.21/0.54 # Rewrite failures with RHS unbound : 0
% 0.21/0.54 # BW rewrite match attempts : 23
% 0.21/0.54 # BW rewrite match successes : 3
% 0.21/0.54 # Condensation attempts : 0
% 0.21/0.54 # Condensation successes : 0
% 0.21/0.54 # Termbank termtop insertions : 14216
% 0.21/0.54
% 0.21/0.54 # -------------------------------------------------
% 0.21/0.54 # User time : 0.021 s
% 0.21/0.54 # System time : 0.005 s
% 0.21/0.54 # Total time : 0.026 s
% 0.21/0.54 # Maximum resident set size: 1848 pages
% 0.21/0.54
% 0.21/0.54 # -------------------------------------------------
% 0.21/0.54 # User time : 0.086 s
% 0.21/0.54 # System time : 0.010 s
% 0.21/0.54 # Total time : 0.096 s
% 0.21/0.54 # Maximum resident set size: 1728 pages
% 0.21/0.54 % E---3.1 exiting
% 0.43/0.54 % E---3.1 exiting
%------------------------------------------------------------------------------