TSTP Solution File: GEO124+1 by E---3.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.2.0
% Problem : GEO124+1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n032.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 Jun 24 06:07:00 EDT 2024
% Result : Theorem 0.15s 0.43s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of formulae : 31 ( 10 unt; 0 def)
% Number of atoms : 136 ( 16 equ)
% Maximal formula atoms : 18 ( 4 avg)
% Number of connectives : 162 ( 57 ~; 57 |; 37 &)
% ( 7 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-4 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-5 aty)
% Number of variables : 89 ( 6 sgn 58 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(between_c_defn,axiom,
! [X1,X3,X5,X7] :
( between_c(X1,X3,X5,X7)
<=> ( X3 != X7
& ? [X8] :
( part_of(X8,X1)
& end_point(X3,X8)
& end_point(X7,X8)
& inner_point(X5,X8) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.kbPx8f9qDG/E---3.1_12723.p',between_c_defn) ).
fof(start_point_defn,axiom,
! [X3,X9] :
( start_point(X3,X9)
<=> ( incident_o(X3,X9)
& ! [X5] :
( ( X3 != X5
& incident_o(X5,X9) )
=> ordered_by(X9,X3,X5) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.kbPx8f9qDG/E---3.1_12723.p',start_point_defn) ).
fof(corollary_4_10_1,conjecture,
! [X9,X3,X5] :
( ( start_point(X3,X9)
& start_point(X5,X9) )
=> X3 = X5 ),
file('/export/starexec/sandbox2/tmp/tmp.kbPx8f9qDG/E---3.1_12723.p',corollary_4_10_1) ).
fof(o3,axiom,
! [X3,X5,X7,X9] :
( between_o(X9,X3,X5,X7)
<=> ? [X1] :
( ! [X3] :
( incident_o(X3,X9)
<=> incident_c(X3,X1) )
& between_c(X1,X3,X5,X7) ) ),
file('/export/starexec/sandbox2/tmp/tmp.kbPx8f9qDG/E---3.1_12723.p',o3) ).
fof(between_o_defn,axiom,
! [X9,X3,X5,X7] :
( between_o(X9,X3,X5,X7)
<=> ( ( ordered_by(X9,X3,X5)
& ordered_by(X9,X5,X7) )
| ( ordered_by(X9,X7,X5)
& ordered_by(X9,X5,X3) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.kbPx8f9qDG/E---3.1_12723.p',between_o_defn) ).
fof(c_0_5,plain,
! [X1,X3,X5,X7] :
( between_c(X1,X3,X5,X7)
<=> ( X3 != X7
& ? [X8] :
( part_of(X8,X1)
& end_point(X3,X8)
& end_point(X7,X8)
& inner_point(X5,X8) ) ) ),
inference(fof_simplification,[status(thm)],[between_c_defn]) ).
fof(c_0_6,plain,
! [X3,X9] :
( start_point(X3,X9)
<=> ( incident_o(X3,X9)
& ! [X5] :
( ( X3 != X5
& incident_o(X5,X9) )
=> ordered_by(X9,X3,X5) ) ) ),
inference(fof_simplification,[status(thm)],[start_point_defn]) ).
fof(c_0_7,negated_conjecture,
~ ! [X9,X3,X5] :
( ( start_point(X3,X9)
& start_point(X5,X9) )
=> X3 = X5 ),
inference(assume_negation,[status(cth)],[corollary_4_10_1]) ).
fof(c_0_8,plain,
! [X85,X86,X87,X88,X90,X91,X92,X93,X94] :
( ( X86 != X88
| ~ between_c(X85,X86,X87,X88) )
& ( part_of(esk14_4(X85,X86,X87,X88),X85)
| ~ between_c(X85,X86,X87,X88) )
& ( end_point(X86,esk14_4(X85,X86,X87,X88))
| ~ between_c(X85,X86,X87,X88) )
& ( end_point(X88,esk14_4(X85,X86,X87,X88))
| ~ between_c(X85,X86,X87,X88) )
& ( inner_point(X87,esk14_4(X85,X86,X87,X88))
| ~ between_c(X85,X86,X87,X88) )
& ( X91 = X93
| ~ part_of(X94,X90)
| ~ end_point(X91,X94)
| ~ end_point(X93,X94)
| ~ inner_point(X92,X94)
| between_c(X90,X91,X92,X93) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])])])])]) ).
fof(c_0_9,plain,
! [X99,X100,X101,X102,X103] :
( ( incident_o(X99,X100)
| ~ start_point(X99,X100) )
& ( X99 = X101
| ~ incident_o(X101,X100)
| ordered_by(X100,X99,X101)
| ~ start_point(X99,X100) )
& ( X102 != esk15_2(X102,X103)
| ~ incident_o(X102,X103)
| start_point(X102,X103) )
& ( incident_o(esk15_2(X102,X103),X103)
| ~ incident_o(X102,X103)
| start_point(X102,X103) )
& ( ~ ordered_by(X103,X102,esk15_2(X102,X103))
| ~ incident_o(X102,X103)
| start_point(X102,X103) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])])])])]) ).
fof(c_0_10,negated_conjecture,
( start_point(esk26_0,esk25_0)
& start_point(esk27_0,esk25_0)
& esk26_0 != esk27_0 ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])]) ).
cnf(c_0_11,plain,
( X1 != X2
| ~ between_c(X3,X1,X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_12,plain,
! [X118,X119,X120,X121,X123,X124,X125,X126,X127,X128,X129] :
( ( ~ incident_o(X123,X121)
| incident_c(X123,esk18_4(X118,X119,X120,X121))
| ~ between_o(X121,X118,X119,X120) )
& ( ~ incident_c(X124,esk18_4(X118,X119,X120,X121))
| incident_o(X124,X121)
| ~ between_o(X121,X118,X119,X120) )
& ( between_c(esk18_4(X118,X119,X120,X121),X118,X119,X120)
| ~ between_o(X121,X118,X119,X120) )
& ( ~ incident_o(esk19_5(X125,X126,X127,X128,X129),X128)
| ~ incident_c(esk19_5(X125,X126,X127,X128,X129),X129)
| ~ between_c(X129,X125,X126,X127)
| between_o(X128,X125,X126,X127) )
& ( incident_o(esk19_5(X125,X126,X127,X128,X129),X128)
| incident_c(esk19_5(X125,X126,X127,X128,X129),X129)
| ~ between_c(X129,X125,X126,X127)
| between_o(X128,X125,X126,X127) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[o3])])])])])])]) ).
cnf(c_0_13,plain,
( incident_o(X1,X2)
| ~ start_point(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,negated_conjecture,
start_point(esk27_0,esk25_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
~ between_c(X1,X2,X3,X2),
inference(er,[status(thm)],[c_0_11]) ).
cnf(c_0_16,plain,
( between_c(esk18_4(X1,X2,X3,X4),X1,X2,X3)
| ~ between_o(X4,X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_17,plain,
! [X95,X96,X97,X98] :
( ( ordered_by(X95,X98,X97)
| ordered_by(X95,X96,X97)
| ~ between_o(X95,X96,X97,X98) )
& ( ordered_by(X95,X97,X96)
| ordered_by(X95,X96,X97)
| ~ between_o(X95,X96,X97,X98) )
& ( ordered_by(X95,X98,X97)
| ordered_by(X95,X97,X98)
| ~ between_o(X95,X96,X97,X98) )
& ( ordered_by(X95,X97,X96)
| ordered_by(X95,X97,X98)
| ~ between_o(X95,X96,X97,X98) )
& ( ~ ordered_by(X95,X96,X97)
| ~ ordered_by(X95,X97,X98)
| between_o(X95,X96,X97,X98) )
& ( ~ ordered_by(X95,X98,X97)
| ~ ordered_by(X95,X97,X96)
| between_o(X95,X96,X97,X98) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[between_o_defn])])])]) ).
cnf(c_0_18,plain,
( X1 = X2
| ordered_by(X3,X1,X2)
| ~ incident_o(X2,X3)
| ~ start_point(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_19,negated_conjecture,
incident_o(esk27_0,esk25_0),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_20,negated_conjecture,
start_point(esk26_0,esk25_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_21,plain,
~ between_o(X1,X2,X3,X2),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_22,plain,
( between_o(X1,X4,X3,X2)
| ~ ordered_by(X1,X2,X3)
| ~ ordered_by(X1,X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_23,negated_conjecture,
( X1 = esk27_0
| ordered_by(esk25_0,X1,esk27_0)
| ~ start_point(X1,esk25_0) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_24,negated_conjecture,
esk26_0 != esk27_0,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_25,negated_conjecture,
incident_o(esk26_0,esk25_0),
inference(spm,[status(thm)],[c_0_13,c_0_20]) ).
cnf(c_0_26,plain,
( ~ ordered_by(X1,X2,X3)
| ~ ordered_by(X1,X3,X2) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_27,negated_conjecture,
ordered_by(esk25_0,esk26_0,esk27_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_20]),c_0_24]) ).
cnf(c_0_28,negated_conjecture,
( X1 = esk26_0
| ordered_by(esk25_0,X1,esk26_0)
| ~ start_point(X1,esk25_0) ),
inference(spm,[status(thm)],[c_0_18,c_0_25]) ).
cnf(c_0_29,negated_conjecture,
~ ordered_by(esk25_0,esk27_0,esk26_0),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_30,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_14]),c_0_24]),c_0_29]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.10 % Problem : GEO124+1 : TPTP v8.2.0. Released v2.4.0.
% 0.06/0.10 % Command : run_E %s %d THM
% 0.09/0.29 % Computer : n032.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29 % CPULimit : 300
% 0.09/0.29 % WCLimit : 300
% 0.09/0.29 % DateTime : Fri Jun 21 09:40:24 EDT 2024
% 0.09/0.29 % CPUTime :
% 0.15/0.40 Running first-order theorem proving
% 0.15/0.40 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.kbPx8f9qDG/E---3.1_12723.p
% 0.15/0.43 # Version: 3.2.0
% 0.15/0.43 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.43 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.43 # Starting sh5l with 300s (1) cores
% 0.15/0.43 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 12801 completed with status 0
% 0.15/0.43 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.15/0.43 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.43 # No SInE strategy applied
% 0.15/0.43 # Search class: FGHSS-FFMF32-SFFFFFNN
% 0.15/0.43 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.43 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 511s (1) cores
% 0.15/0.43 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.15/0.43 # Starting new_bool_3 with 248s (1) cores
% 0.15/0.43 # Starting new_bool_1 with 241s (1) cores
% 0.15/0.43 # Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.15/0.43 # G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S04AN with pid 12811 completed with status 0
% 0.15/0.43 # Result found by G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S04AN
% 0.15/0.43 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.43 # No SInE strategy applied
% 0.15/0.43 # Search class: FGHSS-FFMF32-SFFFFFNN
% 0.15/0.43 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.43 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 511s (1) cores
% 0.15/0.43 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.15/0.43 # Starting new_bool_3 with 248s (1) cores
% 0.15/0.43 # Starting new_bool_1 with 241s (1) cores
% 0.15/0.43 # Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.15/0.43 # Preprocessing time : 0.002 s
% 0.15/0.43 # Presaturation interreduction done
% 0.15/0.43
% 0.15/0.43 # Proof found!
% 0.15/0.43 # SZS status Theorem
% 0.15/0.43 # SZS output start CNFRefutation
% See solution above
% 0.15/0.43 # Parsed axioms : 28
% 0.15/0.43 # Removed by relevancy pruning/SinE : 0
% 0.15/0.43 # Initial clauses : 88
% 0.15/0.43 # Removed in clause preprocessing : 0
% 0.15/0.43 # Initial clauses in saturation : 88
% 0.15/0.43 # Processed clauses : 200
% 0.15/0.43 # ...of these trivial : 0
% 0.15/0.43 # ...subsumed : 3
% 0.15/0.43 # ...remaining for further processing : 197
% 0.15/0.43 # Other redundant clauses eliminated : 7
% 0.15/0.43 # Clauses deleted for lack of memory : 0
% 0.15/0.43 # Backward-subsumed : 0
% 0.15/0.43 # Backward-rewritten : 0
% 0.15/0.43 # Generated clauses : 286
% 0.15/0.43 # ...of the previous two non-redundant : 255
% 0.15/0.43 # ...aggressively subsumed : 0
% 0.15/0.43 # Contextual simplify-reflections : 2
% 0.15/0.43 # Paramodulations : 269
% 0.15/0.43 # Factorizations : 10
% 0.15/0.43 # NegExts : 0
% 0.15/0.43 # Equation resolutions : 7
% 0.15/0.43 # Disequality decompositions : 0
% 0.15/0.43 # Total rewrite steps : 7
% 0.15/0.43 # ...of those cached : 0
% 0.15/0.43 # Propositional unsat checks : 0
% 0.15/0.43 # Propositional check models : 0
% 0.15/0.43 # Propositional check unsatisfiable : 0
% 0.15/0.43 # Propositional clauses : 0
% 0.15/0.43 # Propositional clauses after purity: 0
% 0.15/0.43 # Propositional unsat core size : 0
% 0.15/0.43 # Propositional preprocessing time : 0.000
% 0.15/0.43 # Propositional encoding time : 0.000
% 0.15/0.43 # Propositional solver time : 0.000
% 0.15/0.43 # Success case prop preproc time : 0.000
% 0.15/0.43 # Success case prop encoding time : 0.000
% 0.15/0.43 # Success case prop solver time : 0.000
% 0.15/0.43 # Current number of processed clauses : 102
% 0.15/0.43 # Positive orientable unit clauses : 10
% 0.15/0.43 # Positive unorientable unit clauses: 0
% 0.15/0.43 # Negative unit clauses : 5
% 0.15/0.43 # Non-unit-clauses : 87
% 0.15/0.43 # Current number of unprocessed clauses: 231
% 0.15/0.43 # ...number of literals in the above : 974
% 0.15/0.43 # Current number of archived formulas : 0
% 0.15/0.43 # Current number of archived clauses : 88
% 0.15/0.43 # Clause-clause subsumption calls (NU) : 2979
% 0.15/0.43 # Rec. Clause-clause subsumption calls : 1284
% 0.15/0.43 # Non-unit clause-clause subsumptions : 5
% 0.15/0.43 # Unit Clause-clause subsumption calls : 212
% 0.15/0.43 # Rewrite failures with RHS unbound : 0
% 0.15/0.43 # BW rewrite match attempts : 17
% 0.15/0.43 # BW rewrite match successes : 0
% 0.15/0.43 # Condensation attempts : 0
% 0.15/0.43 # Condensation successes : 0
% 0.15/0.43 # Termbank termtop insertions : 10680
% 0.15/0.43 # Search garbage collected termcells : 1942
% 0.15/0.43
% 0.15/0.43 # -------------------------------------------------
% 0.15/0.43 # User time : 0.013 s
% 0.15/0.43 # System time : 0.001 s
% 0.15/0.43 # Total time : 0.014 s
% 0.15/0.43 # Maximum resident set size: 1972 pages
% 0.15/0.43
% 0.15/0.43 # -------------------------------------------------
% 0.15/0.43 # User time : 0.055 s
% 0.15/0.43 # System time : 0.009 s
% 0.15/0.43 # Total time : 0.064 s
% 0.15/0.43 # Maximum resident set size: 1732 pages
% 0.15/0.43 % E---3.1 exiting
% 0.15/0.43 % E exiting
%------------------------------------------------------------------------------