TSTP Solution File: GEO258+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GEO258+1 : TPTP v8.1.2. Bugfixed v6.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n017.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:25 EDT 2023
% Result : Theorem 0.17s 0.48s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 6
% Syntax : Number of formulae : 47 ( 13 unt; 0 def)
% Number of atoms : 145 ( 0 equ)
% Maximal formula atoms : 19 ( 3 avg)
% Number of connectives : 154 ( 56 ~; 71 |; 21 &)
% ( 3 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-4 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 86 ( 5 sgn; 38 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(con,conjecture,
! [X2,X1,X4,X5] :
( between_on_line(X2,X1,X4,X5)
=> between_on_line(X2,X5,X4,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.V6d4et3uQm/E---3.1_7516.p',con) ).
fof(bf_def,axiom,
! [X2,X1,X4] :
( before_on_line(X2,X1,X4)
<=> ( distinct_points(X1,X4)
& ~ ( left_apart_point(X1,X2)
| left_apart_point(X1,reverse_line(X2)) )
& ~ ( left_apart_point(X4,X2)
| left_apart_point(X4,reverse_line(X2)) )
& ~ unequally_directed_lines(X2,line_connecting(X1,X4)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.V6d4et3uQm/E---3.1_7516.p',bf_def) ).
fof(bet_def,axiom,
! [X2,X1,X4,X5] :
( between_on_line(X2,X1,X4,X5)
<=> ( ( before_on_line(X2,X1,X4)
& before_on_line(X2,X4,X5) )
| ( before_on_line(X2,X5,X4)
& before_on_line(X2,X4,X1) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.V6d4et3uQm/E---3.1_7516.p',bet_def) ).
fof(oag1,axiom,
! [X1] : ~ distinct_points(X1,X1),
file('/export/starexec/sandbox2/tmp/tmp.V6d4et3uQm/E---3.1_7516.p',oag1) ).
fof(oag2,axiom,
! [X1,X4,X5] :
( distinct_points(X1,X4)
=> ( distinct_points(X1,X5)
| distinct_points(X4,X5) ) ),
file('/export/starexec/sandbox2/tmp/tmp.V6d4et3uQm/E---3.1_7516.p',oag2) ).
fof(oag10,axiom,
! [X1,X2] :
~ ( left_apart_point(X1,X2)
| left_apart_point(X1,reverse_line(X2)) ),
file('/export/starexec/sandbox2/tmp/tmp.V6d4et3uQm/E---3.1_7516.p',oag10) ).
fof(c_0_6,negated_conjecture,
~ ! [X2,X1,X4,X5] :
( between_on_line(X2,X1,X4,X5)
=> between_on_line(X2,X5,X4,X1) ),
inference(assume_negation,[status(cth)],[con]) ).
fof(c_0_7,plain,
! [X2,X1,X4] :
( before_on_line(X2,X1,X4)
<=> ( distinct_points(X1,X4)
& ~ ( left_apart_point(X1,X2)
| left_apart_point(X1,reverse_line(X2)) )
& ~ ( left_apart_point(X4,X2)
| left_apart_point(X4,reverse_line(X2)) )
& ~ unequally_directed_lines(X2,line_connecting(X1,X4)) ) ),
inference(fof_simplification,[status(thm)],[bf_def]) ).
fof(c_0_8,plain,
! [X11,X12,X13,X14] :
( ( before_on_line(X11,X14,X13)
| before_on_line(X11,X12,X13)
| ~ between_on_line(X11,X12,X13,X14) )
& ( before_on_line(X11,X13,X12)
| before_on_line(X11,X12,X13)
| ~ between_on_line(X11,X12,X13,X14) )
& ( before_on_line(X11,X14,X13)
| before_on_line(X11,X13,X14)
| ~ between_on_line(X11,X12,X13,X14) )
& ( before_on_line(X11,X13,X12)
| before_on_line(X11,X13,X14)
| ~ between_on_line(X11,X12,X13,X14) )
& ( ~ before_on_line(X11,X12,X13)
| ~ before_on_line(X11,X13,X14)
| between_on_line(X11,X12,X13,X14) )
& ( ~ before_on_line(X11,X14,X13)
| ~ before_on_line(X11,X13,X12)
| between_on_line(X11,X12,X13,X14) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[bet_def])])]) ).
fof(c_0_9,negated_conjecture,
( between_on_line(esk1_0,esk2_0,esk3_0,esk4_0)
& ~ between_on_line(esk1_0,esk4_0,esk3_0,esk2_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
fof(c_0_10,plain,
! [X15,X16,X17] :
( ( distinct_points(X16,X17)
| ~ before_on_line(X15,X16,X17) )
& ( ~ left_apart_point(X16,X15)
| ~ before_on_line(X15,X16,X17) )
& ( ~ left_apart_point(X16,reverse_line(X15))
| ~ before_on_line(X15,X16,X17) )
& ( ~ left_apart_point(X17,X15)
| ~ before_on_line(X15,X16,X17) )
& ( ~ left_apart_point(X17,reverse_line(X15))
| ~ before_on_line(X15,X16,X17) )
& ( ~ unequally_directed_lines(X15,line_connecting(X16,X17))
| ~ before_on_line(X15,X16,X17) )
& ( ~ distinct_points(X16,X17)
| left_apart_point(X16,X15)
| left_apart_point(X16,reverse_line(X15))
| left_apart_point(X17,X15)
| left_apart_point(X17,reverse_line(X15))
| unequally_directed_lines(X15,line_connecting(X16,X17))
| before_on_line(X15,X16,X17) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])]) ).
cnf(c_0_11,plain,
( before_on_line(X1,X2,X3)
| before_on_line(X1,X3,X2)
| ~ between_on_line(X1,X4,X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,negated_conjecture,
between_on_line(esk1_0,esk2_0,esk3_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_13,plain,
! [X1] : ~ distinct_points(X1,X1),
inference(fof_simplification,[status(thm)],[oag1]) ).
fof(c_0_14,plain,
! [X38,X39,X40] :
( ~ distinct_points(X38,X39)
| distinct_points(X38,X40)
| distinct_points(X39,X40) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[oag2])]) ).
cnf(c_0_15,plain,
( distinct_points(X1,X2)
| ~ before_on_line(X3,X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,negated_conjecture,
( before_on_line(esk1_0,esk4_0,esk3_0)
| before_on_line(esk1_0,esk3_0,esk4_0) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
fof(c_0_17,plain,
! [X32,X33] :
( ~ left_apart_point(X32,X33)
& ~ left_apart_point(X32,reverse_line(X33)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[oag10])]) ).
fof(c_0_18,plain,
! [X37] : ~ distinct_points(X37,X37),
inference(variable_rename,[status(thm)],[c_0_13]) ).
cnf(c_0_19,plain,
( distinct_points(X1,X3)
| distinct_points(X2,X3)
| ~ distinct_points(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,negated_conjecture,
( distinct_points(esk4_0,esk3_0)
| before_on_line(esk1_0,esk3_0,esk4_0) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,plain,
( left_apart_point(X1,X3)
| left_apart_point(X1,reverse_line(X3))
| left_apart_point(X2,X3)
| left_apart_point(X2,reverse_line(X3))
| unequally_directed_lines(X3,line_connecting(X1,X2))
| before_on_line(X3,X1,X2)
| ~ distinct_points(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_22,plain,
~ left_apart_point(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_23,plain,
~ distinct_points(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_24,negated_conjecture,
( distinct_points(esk4_0,X1)
| distinct_points(esk3_0,X1)
| before_on_line(esk1_0,esk3_0,esk4_0) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,plain,
( before_on_line(X1,X2,X3)
| before_on_line(X1,X3,X2)
| ~ between_on_line(X1,X3,X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_26,plain,
( before_on_line(X1,X2,X3)
| unequally_directed_lines(X1,line_connecting(X2,X3))
| ~ distinct_points(X2,X3) ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_21,c_0_22]),c_0_22]),c_0_22]),c_0_22]) ).
cnf(c_0_27,negated_conjecture,
distinct_points(esk3_0,esk4_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_15]) ).
cnf(c_0_28,plain,
( between_on_line(X1,X2,X3,X4)
| ~ before_on_line(X1,X2,X3)
| ~ before_on_line(X1,X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_29,negated_conjecture,
( before_on_line(esk1_0,esk3_0,esk2_0)
| before_on_line(esk1_0,esk2_0,esk3_0) ),
inference(spm,[status(thm)],[c_0_25,c_0_12]) ).
cnf(c_0_30,plain,
( before_on_line(X1,X2,X3)
| before_on_line(X1,X4,X3)
| ~ between_on_line(X1,X4,X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_31,plain,
( before_on_line(X1,X2,X3)
| before_on_line(X1,X2,X4)
| ~ between_on_line(X1,X3,X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_32,plain,
( between_on_line(X1,X4,X3,X2)
| ~ before_on_line(X1,X2,X3)
| ~ before_on_line(X1,X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_33,negated_conjecture,
( before_on_line(X1,esk3_0,esk4_0)
| unequally_directed_lines(X1,line_connecting(esk3_0,esk4_0)) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_34,negated_conjecture,
( between_on_line(esk1_0,X1,esk3_0,esk2_0)
| before_on_line(esk1_0,esk2_0,esk3_0)
| ~ before_on_line(esk1_0,X1,esk3_0) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_35,negated_conjecture,
( before_on_line(esk1_0,esk4_0,esk3_0)
| before_on_line(esk1_0,esk2_0,esk3_0) ),
inference(spm,[status(thm)],[c_0_30,c_0_12]) ).
cnf(c_0_36,negated_conjecture,
~ between_on_line(esk1_0,esk4_0,esk3_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_37,plain,
( ~ unequally_directed_lines(X1,line_connecting(X2,X3))
| ~ before_on_line(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_38,negated_conjecture,
( before_on_line(esk1_0,esk3_0,esk2_0)
| before_on_line(esk1_0,esk3_0,esk4_0) ),
inference(spm,[status(thm)],[c_0_31,c_0_12]) ).
cnf(c_0_39,negated_conjecture,
( between_on_line(X1,esk4_0,esk3_0,X2)
| unequally_directed_lines(X1,line_connecting(esk3_0,esk4_0))
| ~ before_on_line(X1,X2,esk3_0) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_40,negated_conjecture,
before_on_line(esk1_0,esk2_0,esk3_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]) ).
cnf(c_0_41,negated_conjecture,
( before_on_line(esk1_0,esk3_0,esk2_0)
| ~ unequally_directed_lines(esk1_0,line_connecting(esk3_0,esk4_0)) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_42,negated_conjecture,
unequally_directed_lines(esk1_0,line_connecting(esk3_0,esk4_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_36]) ).
cnf(c_0_43,negated_conjecture,
before_on_line(esk1_0,esk3_0,esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_41,c_0_42])]) ).
cnf(c_0_44,negated_conjecture,
( between_on_line(esk1_0,X1,esk3_0,esk2_0)
| ~ before_on_line(esk1_0,X1,esk3_0) ),
inference(spm,[status(thm)],[c_0_28,c_0_43]) ).
cnf(c_0_45,negated_conjecture,
before_on_line(esk1_0,esk3_0,esk4_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_16]),c_0_36]) ).
cnf(c_0_46,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_45]),c_0_42])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : GEO258+1 : TPTP v8.1.2. Bugfixed v6.4.0.
% 0.00/0.12 % Command : run_E %s %d THM
% 0.12/0.31 % Computer : n017.cluster.edu
% 0.12/0.31 % Model : x86_64 x86_64
% 0.12/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.31 % Memory : 8042.1875MB
% 0.12/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.31 % CPULimit : 2400
% 0.16/0.31 % WCLimit : 300
% 0.16/0.31 % DateTime : Tue Oct 3 06:09:56 EDT 2023
% 0.16/0.32 % CPUTime :
% 0.17/0.45 Running first-order theorem proving
% 0.17/0.45 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/tmp/tmp.V6d4et3uQm/E---3.1_7516.p
% 0.17/0.48 # Version: 3.1pre001
% 0.17/0.48 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.48 # Starting sh5l with 300s (1) cores
% 0.17/0.48 # new_bool_3 with pid 7595 completed with status 0
% 0.17/0.48 # Result found by new_bool_3
% 0.17/0.48 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.48 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.48 # Search class: FGHNF-FFMF21-SFFFFFNN
% 0.17/0.48 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.48 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with 181s (1) cores
% 0.17/0.48 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with pid 7598 completed with status 0
% 0.17/0.48 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI
% 0.17/0.48 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.48 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.48 # Search class: FGHNF-FFMF21-SFFFFFNN
% 0.17/0.48 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.48 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with 181s (1) cores
% 0.17/0.48 # Preprocessing time : 0.001 s
% 0.17/0.48 # Presaturation interreduction done
% 0.17/0.48
% 0.17/0.48 # Proof found!
% 0.17/0.48 # SZS status Theorem
% 0.17/0.48 # SZS output start CNFRefutation
% See solution above
% 0.17/0.48 # Parsed axioms : 32
% 0.17/0.48 # Removed by relevancy pruning/SinE : 19
% 0.17/0.48 # Initial clauses : 30
% 0.17/0.48 # Removed in clause preprocessing : 0
% 0.17/0.48 # Initial clauses in saturation : 30
% 0.17/0.48 # Processed clauses : 128
% 0.17/0.48 # ...of these trivial : 0
% 0.17/0.48 # ...subsumed : 29
% 0.17/0.48 # ...remaining for further processing : 99
% 0.17/0.48 # Other redundant clauses eliminated : 0
% 0.17/0.48 # Clauses deleted for lack of memory : 0
% 0.17/0.48 # Backward-subsumed : 13
% 0.17/0.48 # Backward-rewritten : 19
% 0.17/0.48 # Generated clauses : 187
% 0.17/0.48 # ...of the previous two non-redundant : 159
% 0.17/0.48 # ...aggressively subsumed : 0
% 0.17/0.48 # Contextual simplify-reflections : 1
% 0.17/0.48 # Paramodulations : 179
% 0.17/0.48 # Factorizations : 8
% 0.17/0.48 # NegExts : 0
% 0.17/0.48 # Equation resolutions : 0
% 0.17/0.48 # Total rewrite steps : 43
% 0.17/0.48 # Propositional unsat checks : 0
% 0.17/0.48 # Propositional check models : 0
% 0.17/0.48 # Propositional check unsatisfiable : 0
% 0.17/0.48 # Propositional clauses : 0
% 0.17/0.48 # Propositional clauses after purity: 0
% 0.17/0.48 # Propositional unsat core size : 0
% 0.17/0.48 # Propositional preprocessing time : 0.000
% 0.17/0.48 # Propositional encoding time : 0.000
% 0.17/0.48 # Propositional solver time : 0.000
% 0.17/0.48 # Success case prop preproc time : 0.000
% 0.17/0.48 # Success case prop encoding time : 0.000
% 0.17/0.48 # Success case prop solver time : 0.000
% 0.17/0.48 # Current number of processed clauses : 46
% 0.17/0.48 # Positive orientable unit clauses : 10
% 0.17/0.48 # Positive unorientable unit clauses: 0
% 0.17/0.48 # Negative unit clauses : 7
% 0.17/0.48 # Non-unit-clauses : 29
% 0.17/0.48 # Current number of unprocessed clauses: 51
% 0.17/0.48 # ...number of literals in the above : 169
% 0.17/0.48 # Current number of archived formulas : 0
% 0.17/0.48 # Current number of archived clauses : 53
% 0.17/0.48 # Clause-clause subsumption calls (NU) : 444
% 0.17/0.48 # Rec. Clause-clause subsumption calls : 278
% 0.17/0.48 # Non-unit clause-clause subsumptions : 32
% 0.17/0.48 # Unit Clause-clause subsumption calls : 57
% 0.17/0.48 # Rewrite failures with RHS unbound : 0
% 0.17/0.48 # BW rewrite match attempts : 9
% 0.17/0.48 # BW rewrite match successes : 6
% 0.17/0.48 # Condensation attempts : 0
% 0.17/0.48 # Condensation successes : 0
% 0.17/0.48 # Termbank termtop insertions : 4272
% 0.17/0.48
% 0.17/0.48 # -------------------------------------------------
% 0.17/0.48 # User time : 0.011 s
% 0.17/0.48 # System time : 0.002 s
% 0.17/0.48 # Total time : 0.013 s
% 0.17/0.48 # Maximum resident set size: 1864 pages
% 0.17/0.48
% 0.17/0.48 # -------------------------------------------------
% 0.17/0.48 # User time : 0.014 s
% 0.17/0.48 # System time : 0.003 s
% 0.17/0.48 # Total time : 0.017 s
% 0.17/0.48 # Maximum resident set size: 1708 pages
% 0.17/0.48 % E---3.1 exiting
% 0.17/0.48 % E---3.1 exiting
%------------------------------------------------------------------------------