TSTP Solution File: GEO111+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GEO111+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n008.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:30 EDT 2023
% Result : Theorem 0.15s 0.43s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 5
% Syntax : Number of formulae : 40 ( 10 unt; 0 def)
% Number of atoms : 159 ( 30 equ)
% Maximal formula atoms : 27 ( 3 avg)
% Number of connectives : 188 ( 69 ~; 73 |; 37 &)
% ( 5 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-4 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-4 aty)
% Number of variables : 81 ( 4 sgn; 45 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(theorem_3_8_1,conjecture,
! [X1,X3,X5,X7] :
( between_c(X1,X3,X5,X7)
=> ( incident_c(X3,X1)
& incident_c(X5,X1)
& incident_c(X7,X1)
& X3 != X5
& X5 != X7
& X3 != X7 ) ),
file('/export/starexec/sandbox2/tmp/tmp.TY6NL9qX06/E---3.1_4491.p',theorem_3_8_1) ).
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.TY6NL9qX06/E---3.1_4491.p',between_c_defn) ).
fof(part_of_defn,axiom,
! [X1,X2] :
( part_of(X2,X1)
<=> ! [X3] :
( incident_c(X3,X2)
=> incident_c(X3,X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.TY6NL9qX06/E---3.1_4491.p',part_of_defn) ).
fof(end_point_defn,axiom,
! [X3,X1] :
( end_point(X3,X1)
<=> ( incident_c(X3,X1)
& ! [X2,X4] :
( ( part_of(X2,X1)
& part_of(X4,X1)
& incident_c(X3,X2)
& incident_c(X3,X4) )
=> ( part_of(X2,X4)
| part_of(X4,X2) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.TY6NL9qX06/E---3.1_4491.p',end_point_defn) ).
fof(inner_point_defn,axiom,
! [X3,X1] :
( inner_point(X3,X1)
<=> ( incident_c(X3,X1)
& ~ end_point(X3,X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.TY6NL9qX06/E---3.1_4491.p',inner_point_defn) ).
fof(c_0_5,negated_conjecture,
~ ! [X1,X3,X5,X7] :
( between_c(X1,X3,X5,X7)
=> ( incident_c(X3,X1)
& incident_c(X5,X1)
& incident_c(X7,X1)
& X3 != X5
& X5 != X7
& X3 != X7 ) ),
inference(assume_negation,[status(cth)],[theorem_3_8_1]) ).
fof(c_0_6,plain,
! [X82,X83,X84,X85,X87,X88,X89,X90,X91] :
( ( X83 != X85
| ~ between_c(X82,X83,X84,X85) )
& ( part_of(esk14_4(X82,X83,X84,X85),X82)
| ~ between_c(X82,X83,X84,X85) )
& ( end_point(X83,esk14_4(X82,X83,X84,X85))
| ~ between_c(X82,X83,X84,X85) )
& ( end_point(X85,esk14_4(X82,X83,X84,X85))
| ~ between_c(X82,X83,X84,X85) )
& ( inner_point(X84,esk14_4(X82,X83,X84,X85))
| ~ between_c(X82,X83,X84,X85) )
& ( X88 = X90
| ~ part_of(X91,X87)
| ~ end_point(X88,X91)
| ~ end_point(X90,X91)
| ~ inner_point(X89,X91)
| between_c(X87,X88,X89,X90) ) ),
inference(distribute,[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)],[between_c_defn])])])])])]) ).
fof(c_0_7,negated_conjecture,
( between_c(esk15_0,esk16_0,esk17_0,esk18_0)
& ( ~ incident_c(esk16_0,esk15_0)
| ~ incident_c(esk17_0,esk15_0)
| ~ incident_c(esk18_0,esk15_0)
| esk16_0 = esk17_0
| esk17_0 = esk18_0
| esk16_0 = esk18_0 ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
fof(c_0_8,plain,
! [X9,X10,X11,X12,X13] :
( ( ~ part_of(X10,X9)
| ~ incident_c(X11,X10)
| incident_c(X11,X9) )
& ( incident_c(esk1_2(X12,X13),X13)
| part_of(X13,X12) )
& ( ~ incident_c(esk1_2(X12,X13),X12)
| part_of(X13,X12) ) ),
inference(distribute,[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)],[part_of_defn])])])])])]) ).
cnf(c_0_9,plain,
( part_of(esk14_4(X1,X2,X3,X4),X1)
| ~ between_c(X1,X2,X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
between_c(esk15_0,esk16_0,esk17_0,esk18_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
( incident_c(X3,X2)
| ~ part_of(X1,X2)
| ~ incident_c(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,negated_conjecture,
part_of(esk14_4(esk15_0,esk16_0,esk17_0,esk18_0),esk15_0),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
fof(c_0_13,plain,
! [X24,X25,X26,X27,X28,X29] :
( ( incident_c(X24,X25)
| ~ end_point(X24,X25) )
& ( ~ part_of(X26,X25)
| ~ part_of(X27,X25)
| ~ incident_c(X24,X26)
| ~ incident_c(X24,X27)
| part_of(X26,X27)
| part_of(X27,X26)
| ~ end_point(X24,X25) )
& ( part_of(esk3_2(X28,X29),X29)
| ~ incident_c(X28,X29)
| end_point(X28,X29) )
& ( part_of(esk4_2(X28,X29),X29)
| ~ incident_c(X28,X29)
| end_point(X28,X29) )
& ( incident_c(X28,esk3_2(X28,X29))
| ~ incident_c(X28,X29)
| end_point(X28,X29) )
& ( incident_c(X28,esk4_2(X28,X29))
| ~ incident_c(X28,X29)
| end_point(X28,X29) )
& ( ~ part_of(esk3_2(X28,X29),esk4_2(X28,X29))
| ~ incident_c(X28,X29)
| end_point(X28,X29) )
& ( ~ part_of(esk4_2(X28,X29),esk3_2(X28,X29))
| ~ incident_c(X28,X29)
| end_point(X28,X29) ) ),
inference(distribute,[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)],[end_point_defn])])])])])]) ).
fof(c_0_14,plain,
! [X3,X1] :
( inner_point(X3,X1)
<=> ( incident_c(X3,X1)
& ~ end_point(X3,X1) ) ),
inference(fof_simplification,[status(thm)],[inner_point_defn]) ).
cnf(c_0_15,negated_conjecture,
( incident_c(X1,esk15_0)
| ~ incident_c(X1,esk14_4(esk15_0,esk16_0,esk17_0,esk18_0)) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,plain,
( incident_c(X1,X2)
| ~ end_point(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_17,plain,
( end_point(X1,esk14_4(X2,X3,X4,X1))
| ~ between_c(X2,X3,X4,X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_18,plain,
! [X32,X33] :
( ( incident_c(X32,X33)
| ~ inner_point(X32,X33) )
& ( ~ end_point(X32,X33)
| ~ inner_point(X32,X33) )
& ( ~ incident_c(X32,X33)
| end_point(X32,X33)
| inner_point(X32,X33) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])]) ).
cnf(c_0_19,negated_conjecture,
( esk16_0 = esk17_0
| esk17_0 = esk18_0
| esk16_0 = esk18_0
| ~ incident_c(esk16_0,esk15_0)
| ~ incident_c(esk17_0,esk15_0)
| ~ incident_c(esk18_0,esk15_0) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_20,negated_conjecture,
( incident_c(X1,esk15_0)
| ~ end_point(X1,esk14_4(esk15_0,esk16_0,esk17_0,esk18_0)) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,negated_conjecture,
end_point(esk18_0,esk14_4(esk15_0,esk16_0,esk17_0,esk18_0)),
inference(spm,[status(thm)],[c_0_17,c_0_10]) ).
cnf(c_0_22,plain,
( incident_c(X1,X2)
| ~ inner_point(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_23,plain,
( inner_point(X1,esk14_4(X2,X3,X1,X4))
| ~ between_c(X2,X3,X1,X4) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_24,negated_conjecture,
( esk18_0 = esk17_0
| esk18_0 = esk16_0
| esk17_0 = esk16_0
| ~ incident_c(esk16_0,esk15_0)
| ~ incident_c(esk17_0,esk15_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]) ).
cnf(c_0_25,negated_conjecture,
( incident_c(X1,esk15_0)
| ~ inner_point(X1,esk14_4(esk15_0,esk16_0,esk17_0,esk18_0)) ),
inference(spm,[status(thm)],[c_0_15,c_0_22]) ).
cnf(c_0_26,negated_conjecture,
inner_point(esk17_0,esk14_4(esk15_0,esk16_0,esk17_0,esk18_0)),
inference(spm,[status(thm)],[c_0_23,c_0_10]) ).
cnf(c_0_27,plain,
( end_point(X1,esk14_4(X2,X1,X3,X4))
| ~ between_c(X2,X1,X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_28,plain,
( ~ end_point(X1,X2)
| ~ inner_point(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_29,negated_conjecture,
( esk17_0 = esk16_0
| esk18_0 = esk16_0
| esk18_0 = esk17_0
| ~ incident_c(esk16_0,esk15_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26])]) ).
cnf(c_0_30,negated_conjecture,
end_point(esk16_0,esk14_4(esk15_0,esk16_0,esk17_0,esk18_0)),
inference(spm,[status(thm)],[c_0_27,c_0_10]) ).
cnf(c_0_31,negated_conjecture,
~ end_point(esk17_0,esk14_4(esk15_0,esk16_0,esk17_0,esk18_0)),
inference(spm,[status(thm)],[c_0_28,c_0_26]) ).
cnf(c_0_32,negated_conjecture,
( esk18_0 = esk17_0
| esk18_0 = esk16_0
| esk17_0 = esk16_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_20]),c_0_30])]) ).
cnf(c_0_33,negated_conjecture,
( esk17_0 = esk16_0
| esk18_0 = esk16_0
| ~ end_point(esk17_0,esk14_4(esk15_0,esk16_0,esk17_0,esk17_0)) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_34,plain,
( X1 != X2
| ~ between_c(X3,X1,X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_35,negated_conjecture,
( esk17_0 = esk16_0
| esk18_0 = esk16_0 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_32]),c_0_33]) ).
cnf(c_0_36,plain,
~ between_c(X1,X2,X3,X2),
inference(er,[status(thm)],[c_0_34]) ).
cnf(c_0_37,negated_conjecture,
esk17_0 = esk16_0,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_35]),c_0_36]) ).
cnf(c_0_38,negated_conjecture,
~ end_point(esk16_0,esk14_4(esk15_0,esk16_0,esk16_0,esk18_0)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_37]),c_0_37]) ).
cnf(c_0_39,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_37]),c_0_38]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10 % Problem : GEO111+1 : TPTP v8.1.2. Released v2.4.0.
% 0.02/0.10 % Command : run_E %s %d THM
% 0.10/0.30 % Computer : n008.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 2400
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Tue Oct 3 07:05:58 EDT 2023
% 0.10/0.30 % CPUTime :
% 0.15/0.41 Running first-order theorem proving
% 0.15/0.41 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.TY6NL9qX06/E---3.1_4491.p
% 0.15/0.43 # Version: 3.1pre001
% 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 4569 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: FGHSF-FFMF32-SFFFFFNN
% 0.15/0.43 # Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.43 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 901s (1) cores
% 0.15/0.43 # Starting G-E--_107_C36_F1_PI_AE_Q4_CS_SP_PS_S0Y with 151s (1) cores
% 0.15/0.43 # Starting new_bool_3 with 151s (1) cores
% 0.15/0.43 # Starting new_bool_1 with 151s (1) cores
% 0.15/0.43 # Starting G-E--_208_C18_F1_AE_CS_SP_PI_S0a with 146s (1) cores
% 0.15/0.43 # G-E--_107_C36_F1_PI_AE_Q4_CS_SP_PS_S0Y with pid 4576 completed with status 0
% 0.15/0.43 # Result found by G-E--_107_C36_F1_PI_AE_Q4_CS_SP_PS_S0Y
% 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: FGHSF-FFMF32-SFFFFFNN
% 0.15/0.43 # Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.43 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 901s (1) cores
% 0.15/0.43 # Starting G-E--_107_C36_F1_PI_AE_Q4_CS_SP_PS_S0Y with 151s (1) cores
% 0.15/0.43 # Preprocessing time : 0.001 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 : 18
% 0.15/0.43 # Removed by relevancy pruning/SinE : 0
% 0.15/0.43 # Initial clauses : 51
% 0.15/0.43 # Removed in clause preprocessing : 0
% 0.15/0.43 # Initial clauses in saturation : 51
% 0.15/0.43 # Processed clauses : 154
% 0.15/0.43 # ...of these trivial : 0
% 0.15/0.43 # ...subsumed : 6
% 0.15/0.43 # ...remaining for further processing : 147
% 0.15/0.43 # Other redundant clauses eliminated : 4
% 0.15/0.43 # Clauses deleted for lack of memory : 0
% 0.15/0.43 # Backward-subsumed : 16
% 0.15/0.43 # Backward-rewritten : 4
% 0.15/0.43 # Generated clauses : 275
% 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 : 1
% 0.15/0.43 # Paramodulations : 259
% 0.15/0.43 # Factorizations : 9
% 0.15/0.43 # NegExts : 0
% 0.15/0.43 # Equation resolutions : 7
% 0.15/0.43 # Total rewrite steps : 14
% 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 : 75
% 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 : 4
% 0.15/0.43 # Non-unit-clauses : 61
% 0.15/0.43 # Current number of unprocessed clauses: 192
% 0.15/0.43 # ...number of literals in the above : 788
% 0.15/0.43 # Current number of archived formulas : 0
% 0.15/0.43 # Current number of archived clauses : 71
% 0.15/0.43 # Clause-clause subsumption calls (NU) : 2228
% 0.15/0.43 # Rec. Clause-clause subsumption calls : 922
% 0.15/0.43 # Non-unit clause-clause subsumptions : 21
% 0.15/0.43 # Unit Clause-clause subsumption calls : 75
% 0.15/0.43 # Rewrite failures with RHS unbound : 0
% 0.15/0.43 # BW rewrite match attempts : 19
% 0.15/0.43 # BW rewrite match successes : 1
% 0.15/0.43 # Condensation attempts : 0
% 0.15/0.43 # Condensation successes : 0
% 0.15/0.43 # Termbank termtop insertions : 7483
% 0.15/0.43
% 0.15/0.43 # -------------------------------------------------
% 0.15/0.43 # User time : 0.012 s
% 0.15/0.43 # System time : 0.006 s
% 0.15/0.43 # Total time : 0.018 s
% 0.15/0.43 # Maximum resident set size: 1868 pages
% 0.15/0.43
% 0.15/0.43 # -------------------------------------------------
% 0.15/0.43 # User time : 0.061 s
% 0.15/0.43 # System time : 0.012 s
% 0.15/0.43 # Total time : 0.073 s
% 0.15/0.43 # Maximum resident set size: 1700 pages
% 0.15/0.43 % E---3.1 exiting
% 0.15/0.43 % E---3.1 exiting
%------------------------------------------------------------------------------