TSTP Solution File: GEO188+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GEO188+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n028.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:31:58 EDT 2023
% Result : Theorem 0.22s 0.51s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 7
% Syntax : Number of formulae : 42 ( 11 unt; 0 def)
% Number of atoms : 112 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 102 ( 32 ~; 50 |; 11 &)
% ( 0 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 69 ( 0 sgn; 41 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(con,conjecture,
! [X1,X2,X3] :
( ( distinct_points(X1,X2)
& distinct_points(X1,X3)
& distinct_points(X2,X3)
& ~ apart_point_and_line(X3,line_connecting(X1,X2)) )
=> ~ apart_point_and_line(X1,line_connecting(X3,X2)) ),
file('/export/starexec/sandbox/tmp/tmp.9ePK3eM4Zj/E---3.1_21458.p',con) ).
fof(apart4,axiom,
! [X1,X2,X3] :
( distinct_points(X1,X2)
=> ( distinct_points(X1,X3)
| distinct_points(X2,X3) ) ),
file('/export/starexec/sandbox/tmp/tmp.9ePK3eM4Zj/E---3.1_21458.p',apart4) ).
fof(apart1,axiom,
! [X1] : ~ distinct_points(X1,X1),
file('/export/starexec/sandbox/tmp/tmp.9ePK3eM4Zj/E---3.1_21458.p',apart1) ).
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/sandbox/tmp/tmp.9ePK3eM4Zj/E---3.1_21458.p',ceq2) ).
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.9ePK3eM4Zj/E---3.1_21458.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.9ePK3eM4Zj/E---3.1_21458.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.9ePK3eM4Zj/E---3.1_21458.p',ci2) ).
fof(c_0_7,negated_conjecture,
~ ! [X1,X2,X3] :
( ( distinct_points(X1,X2)
& distinct_points(X1,X3)
& distinct_points(X2,X3)
& ~ apart_point_and_line(X3,line_connecting(X1,X2)) )
=> ~ apart_point_and_line(X1,line_connecting(X3,X2)) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[con])]) ).
fof(c_0_8,plain,
! [X17,X18,X19] :
( ~ distinct_points(X17,X18)
| distinct_points(X17,X19)
| distinct_points(X18,X19) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[apart4])]) ).
fof(c_0_9,negated_conjecture,
( distinct_points(esk1_0,esk2_0)
& distinct_points(esk1_0,esk3_0)
& distinct_points(esk2_0,esk3_0)
& ~ apart_point_and_line(esk3_0,line_connecting(esk1_0,esk2_0))
& apart_point_and_line(esk1_0,line_connecting(esk3_0,esk2_0)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])]) ).
fof(c_0_10,plain,
! [X1] : ~ distinct_points(X1,X1),
inference(fof_simplification,[status(thm)],[apart1]) ).
cnf(c_0_11,plain,
( distinct_points(X1,X3)
| distinct_points(X2,X3)
| ~ distinct_points(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,negated_conjecture,
distinct_points(esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_13,plain,
! [X16] : ~ distinct_points(X16,X16),
inference(variable_rename,[status(thm)],[c_0_10]) ).
cnf(c_0_14,negated_conjecture,
( distinct_points(esk2_0,X1)
| distinct_points(esk3_0,X1) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,plain,
~ distinct_points(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_16,negated_conjecture,
( distinct_points(esk2_0,X1)
| distinct_points(esk3_0,X2)
| distinct_points(X1,X2) ),
inference(spm,[status(thm)],[c_0_11,c_0_14]) ).
fof(c_0_17,plain,
! [X28,X29,X30] :
( ~ apart_point_and_line(X28,X29)
| distinct_lines(X29,X30)
| apart_point_and_line(X28,X30) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ceq2])]) ).
cnf(c_0_18,negated_conjecture,
( distinct_points(X1,esk3_0)
| distinct_points(esk2_0,X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
fof(c_0_19,plain,
! [X20,X21,X22,X23] :
( ~ distinct_points(X20,X21)
| ~ distinct_lines(X22,X23)
| apart_point_and_line(X20,X22)
| apart_point_and_line(X20,X23)
| apart_point_and_line(X21,X22)
| apart_point_and_line(X21,X23) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cu1])]) ).
cnf(c_0_20,plain,
( distinct_lines(X2,X3)
| apart_point_and_line(X1,X3)
| ~ apart_point_and_line(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_21,negated_conjecture,
apart_point_and_line(esk1_0,line_connecting(esk3_0,esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_22,negated_conjecture,
( distinct_points(X1,esk3_0)
| distinct_points(esk2_0,X2)
| distinct_points(X1,X2) ),
inference(spm,[status(thm)],[c_0_11,c_0_18]) ).
fof(c_0_23,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_24,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_19]) ).
cnf(c_0_25,negated_conjecture,
( apart_point_and_line(esk1_0,X1)
| distinct_lines(line_connecting(esk3_0,esk2_0),X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_26,negated_conjecture,
( distinct_points(X1,esk2_0)
| distinct_points(X1,esk3_0) ),
inference(spm,[status(thm)],[c_0_15,c_0_22]) ).
fof(c_0_27,plain,
! [X12,X13] :
( ~ distinct_points(X12,X13)
| ~ apart_point_and_line(X12,line_connecting(X12,X13)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_23])]) ).
cnf(c_0_28,negated_conjecture,
( apart_point_and_line(X1,line_connecting(esk3_0,esk2_0))
| apart_point_and_line(X2,line_connecting(esk3_0,esk2_0))
| apart_point_and_line(esk1_0,X3)
| apart_point_and_line(X1,X3)
| apart_point_and_line(X2,X3)
| ~ distinct_points(X1,X2) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_29,negated_conjecture,
distinct_points(esk3_0,esk2_0),
inference(spm,[status(thm)],[c_0_15,c_0_26]) ).
cnf(c_0_30,plain,
( ~ distinct_points(X1,X2)
| ~ apart_point_and_line(X1,line_connecting(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_31,negated_conjecture,
( apart_point_and_line(esk2_0,line_connecting(esk3_0,esk2_0))
| apart_point_and_line(esk3_0,line_connecting(esk3_0,esk2_0))
| apart_point_and_line(esk2_0,X1)
| apart_point_and_line(esk3_0,X1)
| apart_point_and_line(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
fof(c_0_32,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_33,negated_conjecture,
~ apart_point_and_line(esk3_0,line_connecting(esk1_0,esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_34,negated_conjecture,
( apart_point_and_line(esk2_0,line_connecting(esk3_0,esk2_0))
| apart_point_and_line(esk1_0,X1)
| apart_point_and_line(esk3_0,X1)
| apart_point_and_line(esk2_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_29])]) ).
fof(c_0_35,plain,
! [X14,X15] :
( ~ distinct_points(X14,X15)
| ~ apart_point_and_line(X15,line_connecting(X14,X15)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_32])]) ).
cnf(c_0_36,negated_conjecture,
( apart_point_and_line(esk2_0,line_connecting(esk1_0,esk2_0))
| apart_point_and_line(esk1_0,line_connecting(esk1_0,esk2_0))
| apart_point_and_line(esk2_0,line_connecting(esk3_0,esk2_0)) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_37,negated_conjecture,
distinct_points(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_38,plain,
( ~ distinct_points(X1,X2)
| ~ apart_point_and_line(X2,line_connecting(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_39,negated_conjecture,
( apart_point_and_line(esk2_0,line_connecting(esk3_0,esk2_0))
| apart_point_and_line(esk2_0,line_connecting(esk1_0,esk2_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_36]),c_0_37])]) ).
cnf(c_0_40,negated_conjecture,
apart_point_and_line(esk2_0,line_connecting(esk1_0,esk2_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_29])]) ).
cnf(c_0_41,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_40]),c_0_37])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : GEO188+1 : TPTP v8.1.2. Released v3.3.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n028.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 : 2400
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Tue Oct 3 07:04:52 EDT 2023
% 0.15/0.36 % CPUTime :
% 0.22/0.49 Running first-order theorem proving
% 0.22/0.49 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.9ePK3eM4Zj/E---3.1_21458.p
% 0.22/0.51 # Version: 3.1pre001
% 0.22/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.51 # Starting sh5l with 300s (1) cores
% 0.22/0.51 # new_bool_3 with pid 21585 completed with status 0
% 0.22/0.51 # Result found by new_bool_3
% 0.22/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.51 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.22/0.51 # Search class: FGHNF-FFSS22-SFFFFFNN
% 0.22/0.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.51 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.22/0.51 # SAT001_MinMin_p005000_rr_RG with pid 21591 completed with status 0
% 0.22/0.51 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.22/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.51 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.22/0.51 # Search class: FGHNF-FFSS22-SFFFFFNN
% 0.22/0.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.51 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.22/0.51 # Preprocessing time : 0.001 s
% 0.22/0.51 # Presaturation interreduction done
% 0.22/0.51
% 0.22/0.51 # Proof found!
% 0.22/0.51 # SZS status Theorem
% 0.22/0.51 # SZS output start CNFRefutation
% See solution above
% 0.22/0.51 # Parsed axioms : 15
% 0.22/0.51 # Removed by relevancy pruning/SinE : 2
% 0.22/0.51 # Initial clauses : 17
% 0.22/0.51 # Removed in clause preprocessing : 0
% 0.22/0.51 # Initial clauses in saturation : 17
% 0.22/0.51 # Processed clauses : 95
% 0.22/0.51 # ...of these trivial : 0
% 0.22/0.51 # ...subsumed : 26
% 0.22/0.51 # ...remaining for further processing : 69
% 0.22/0.51 # Other redundant clauses eliminated : 0
% 0.22/0.51 # Clauses deleted for lack of memory : 0
% 0.22/0.51 # Backward-subsumed : 2
% 0.22/0.51 # Backward-rewritten : 1
% 0.22/0.51 # Generated clauses : 243
% 0.22/0.51 # ...of the previous two non-redundant : 166
% 0.22/0.51 # ...aggressively subsumed : 0
% 0.22/0.51 # Contextual simplify-reflections : 0
% 0.22/0.51 # Paramodulations : 195
% 0.22/0.51 # Factorizations : 48
% 0.22/0.51 # NegExts : 0
% 0.22/0.51 # Equation resolutions : 0
% 0.22/0.51 # Total rewrite steps : 84
% 0.22/0.51 # Propositional unsat checks : 0
% 0.22/0.51 # Propositional check models : 0
% 0.22/0.51 # Propositional check unsatisfiable : 0
% 0.22/0.51 # Propositional clauses : 0
% 0.22/0.51 # Propositional clauses after purity: 0
% 0.22/0.51 # Propositional unsat core size : 0
% 0.22/0.51 # Propositional preprocessing time : 0.000
% 0.22/0.51 # Propositional encoding time : 0.000
% 0.22/0.51 # Propositional solver time : 0.000
% 0.22/0.51 # Success case prop preproc time : 0.000
% 0.22/0.51 # Success case prop encoding time : 0.000
% 0.22/0.51 # Success case prop solver time : 0.000
% 0.22/0.51 # Current number of processed clauses : 49
% 0.22/0.51 # Positive orientable unit clauses : 8
% 0.22/0.51 # Positive unorientable unit clauses: 0
% 0.22/0.51 # Negative unit clauses : 4
% 0.22/0.51 # Non-unit-clauses : 37
% 0.22/0.51 # Current number of unprocessed clauses: 103
% 0.22/0.51 # ...number of literals in the above : 521
% 0.22/0.51 # Current number of archived formulas : 0
% 0.22/0.51 # Current number of archived clauses : 20
% 0.22/0.51 # Clause-clause subsumption calls (NU) : 249
% 0.22/0.51 # Rec. Clause-clause subsumption calls : 167
% 0.22/0.51 # Non-unit clause-clause subsumptions : 28
% 0.22/0.51 # Unit Clause-clause subsumption calls : 16
% 0.22/0.51 # Rewrite failures with RHS unbound : 0
% 0.22/0.51 # BW rewrite match attempts : 1
% 0.22/0.51 # BW rewrite match successes : 1
% 0.22/0.51 # Condensation attempts : 0
% 0.22/0.51 # Condensation successes : 0
% 0.22/0.51 # Termbank termtop insertions : 3889
% 0.22/0.51
% 0.22/0.51 # -------------------------------------------------
% 0.22/0.51 # User time : 0.011 s
% 0.22/0.51 # System time : 0.001 s
% 0.22/0.51 # Total time : 0.012 s
% 0.22/0.51 # Maximum resident set size: 1704 pages
% 0.22/0.51
% 0.22/0.51 # -------------------------------------------------
% 0.22/0.51 # User time : 0.012 s
% 0.22/0.51 # System time : 0.003 s
% 0.22/0.51 # Total time : 0.015 s
% 0.22/0.51 # Maximum resident set size: 1684 pages
% 0.22/0.51 % E---3.1 exiting
% 0.22/0.51 % E---3.1 exiting
%------------------------------------------------------------------------------