TSTP Solution File: GEO117+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GEO117+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n023.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:31 EDT 2023
% Result : Theorem 0.20s 0.52s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of formulae : 17 ( 7 unt; 0 def)
% Number of atoms : 81 ( 4 equ)
% Maximal formula atoms : 18 ( 4 avg)
% Number of connectives : 104 ( 40 ~; 39 |; 21 &)
% ( 4 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 7 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-4 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-5 aty)
% Number of variables : 64 ( 6 sgn; 41 !; 2 ?)
% 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/sandbox/tmp/tmp.SgYUjhKNUB/E---3.1_9475.p',between_c_defn) ).
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/sandbox/tmp/tmp.SgYUjhKNUB/E---3.1_9475.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/sandbox/tmp/tmp.SgYUjhKNUB/E---3.1_9475.p',between_o_defn) ).
fof(theorem_4_4,conjecture,
! [X9,X3] : ~ ordered_by(X9,X3,X3),
file('/export/starexec/sandbox/tmp/tmp.SgYUjhKNUB/E---3.1_9475.p',theorem_4_4) ).
fof(c_0_4,plain,
! [X98,X99,X100,X101,X103,X104,X105,X106,X107] :
( ( X99 != X101
| ~ between_c(X98,X99,X100,X101) )
& ( part_of(esk18_4(X98,X99,X100,X101),X98)
| ~ between_c(X98,X99,X100,X101) )
& ( end_point(X99,esk18_4(X98,X99,X100,X101))
| ~ between_c(X98,X99,X100,X101) )
& ( end_point(X101,esk18_4(X98,X99,X100,X101))
| ~ between_c(X98,X99,X100,X101) )
& ( inner_point(X100,esk18_4(X98,X99,X100,X101))
| ~ between_c(X98,X99,X100,X101) )
& ( X104 = X106
| ~ part_of(X107,X103)
| ~ end_point(X104,X107)
| ~ end_point(X106,X107)
| ~ inner_point(X105,X107)
| between_c(X103,X104,X105,X106) ) ),
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])])])])])]) ).
cnf(c_0_5,plain,
( X1 != X2
| ~ between_c(X3,X1,X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
fof(c_0_6,plain,
! [X37,X38,X39,X40,X42,X43,X44,X45,X46,X47,X48] :
( ( ~ incident_o(X42,X40)
| incident_c(X42,esk7_4(X37,X38,X39,X40))
| ~ between_o(X40,X37,X38,X39) )
& ( ~ incident_c(X43,esk7_4(X37,X38,X39,X40))
| incident_o(X43,X40)
| ~ between_o(X40,X37,X38,X39) )
& ( between_c(esk7_4(X37,X38,X39,X40),X37,X38,X39)
| ~ between_o(X40,X37,X38,X39) )
& ( ~ incident_o(esk8_5(X44,X45,X46,X47,X48),X47)
| ~ incident_c(esk8_5(X44,X45,X46,X47,X48),X48)
| ~ between_c(X48,X44,X45,X46)
| between_o(X47,X44,X45,X46) )
& ( incident_o(esk8_5(X44,X45,X46,X47,X48),X47)
| incident_c(esk8_5(X44,X45,X46,X47,X48),X48)
| ~ between_c(X48,X44,X45,X46)
| between_o(X47,X44,X45,X46) ) ),
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)],[o3])])])])])]) ).
cnf(c_0_7,plain,
~ between_c(X1,X2,X3,X2),
inference(er,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
( between_c(esk7_4(X1,X2,X3,X4),X1,X2,X3)
| ~ between_o(X4,X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_9,plain,
! [X14,X15,X16,X17] :
( ( ordered_by(X14,X17,X16)
| ordered_by(X14,X15,X16)
| ~ between_o(X14,X15,X16,X17) )
& ( ordered_by(X14,X16,X15)
| ordered_by(X14,X15,X16)
| ~ between_o(X14,X15,X16,X17) )
& ( ordered_by(X14,X17,X16)
| ordered_by(X14,X16,X17)
| ~ between_o(X14,X15,X16,X17) )
& ( ordered_by(X14,X16,X15)
| ordered_by(X14,X16,X17)
| ~ between_o(X14,X15,X16,X17) )
& ( ~ ordered_by(X14,X15,X16)
| ~ ordered_by(X14,X16,X17)
| between_o(X14,X15,X16,X17) )
& ( ~ ordered_by(X14,X17,X16)
| ~ ordered_by(X14,X16,X15)
| between_o(X14,X15,X16,X17) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[between_o_defn])])]) ).
fof(c_0_10,negated_conjecture,
~ ! [X9,X3] : ~ ordered_by(X9,X3,X3),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[theorem_4_4])]) ).
cnf(c_0_11,plain,
~ between_o(X1,X2,X3,X2),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_12,plain,
( between_o(X1,X4,X3,X2)
| ~ ordered_by(X1,X2,X3)
| ~ ordered_by(X1,X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_13,negated_conjecture,
ordered_by(esk1_0,esk2_0,esk2_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])]) ).
cnf(c_0_14,plain,
( ~ ordered_by(X1,X2,X3)
| ~ ordered_by(X1,X3,X2) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,negated_conjecture,
ordered_by(esk1_0,esk2_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_16,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_15])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.13 % Problem : GEO117+1 : TPTP v8.1.2. Released v2.4.0.
% 0.13/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n023.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 2400
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Tue Oct 3 07:12:37 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 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.SgYUjhKNUB/E---3.1_9475.p
% 0.20/0.51 # Version: 3.1pre001
% 0.20/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.51 # Starting sh5l with 300s (1) cores
% 0.20/0.51 # sh5l with pid 9556 completed with status 0
% 0.20/0.51 # Result found by sh5l
% 0.20/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.51 # Starting sh5l with 300s (1) cores
% 0.20/0.51 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.20/0.51 # Search class: FGHSS-FFMF32-SFFFFFNN
% 0.20/0.51 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.51 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 103s (1) cores
% 0.20/0.51 # G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 9561 completed with status 0
% 0.20/0.51 # Result found by G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.20/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.52 # Starting sh5l with 300s (1) cores
% 0.20/0.52 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.20/0.52 # Search class: FGHSS-FFMF32-SFFFFFNN
% 0.20/0.52 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.52 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 103s (1) cores
% 0.20/0.52 # Preprocessing time : 0.002 s
% 0.20/0.52 # Presaturation interreduction done
% 0.20/0.52
% 0.20/0.52 # Proof found!
% 0.20/0.52 # SZS status Theorem
% 0.20/0.52 # SZS output start CNFRefutation
% See solution above
% 0.20/0.52 # Parsed axioms : 28
% 0.20/0.52 # Removed by relevancy pruning/SinE : 2
% 0.20/0.52 # Initial clauses : 77
% 0.20/0.52 # Removed in clause preprocessing : 0
% 0.20/0.52 # Initial clauses in saturation : 77
% 0.20/0.52 # Processed clauses : 255
% 0.20/0.52 # ...of these trivial : 1
% 0.20/0.52 # ...subsumed : 22
% 0.20/0.52 # ...remaining for further processing : 232
% 0.20/0.52 # Other redundant clauses eliminated : 5
% 0.20/0.52 # Clauses deleted for lack of memory : 0
% 0.20/0.52 # Backward-subsumed : 0
% 0.20/0.52 # Backward-rewritten : 0
% 0.20/0.52 # Generated clauses : 443
% 0.20/0.52 # ...of the previous two non-redundant : 405
% 0.20/0.52 # ...aggressively subsumed : 0
% 0.20/0.52 # Contextual simplify-reflections : 2
% 0.20/0.52 # Paramodulations : 438
% 0.20/0.52 # Factorizations : 0
% 0.20/0.52 # NegExts : 0
% 0.20/0.52 # Equation resolutions : 5
% 0.20/0.52 # Total rewrite steps : 23
% 0.20/0.52 # Propositional unsat checks : 0
% 0.20/0.52 # Propositional check models : 0
% 0.20/0.52 # Propositional check unsatisfiable : 0
% 0.20/0.52 # Propositional clauses : 0
% 0.20/0.52 # Propositional clauses after purity: 0
% 0.20/0.52 # Propositional unsat core size : 0
% 0.20/0.52 # Propositional preprocessing time : 0.000
% 0.20/0.52 # Propositional encoding time : 0.000
% 0.20/0.52 # Propositional solver time : 0.000
% 0.20/0.52 # Success case prop preproc time : 0.000
% 0.20/0.52 # Success case prop encoding time : 0.000
% 0.20/0.52 # Success case prop solver time : 0.000
% 0.20/0.52 # Current number of processed clauses : 150
% 0.20/0.52 # Positive orientable unit clauses : 22
% 0.20/0.52 # Positive unorientable unit clauses: 0
% 0.20/0.52 # Negative unit clauses : 8
% 0.20/0.52 # Non-unit-clauses : 120
% 0.20/0.52 # Current number of unprocessed clauses: 302
% 0.20/0.52 # ...number of literals in the above : 877
% 0.20/0.52 # Current number of archived formulas : 0
% 0.20/0.52 # Current number of archived clauses : 77
% 0.20/0.52 # Clause-clause subsumption calls (NU) : 3705
% 0.20/0.52 # Rec. Clause-clause subsumption calls : 2596
% 0.20/0.52 # Non-unit clause-clause subsumptions : 24
% 0.20/0.52 # Unit Clause-clause subsumption calls : 478
% 0.20/0.52 # Rewrite failures with RHS unbound : 0
% 0.20/0.52 # BW rewrite match attempts : 5
% 0.20/0.52 # BW rewrite match successes : 0
% 0.20/0.52 # Condensation attempts : 0
% 0.20/0.52 # Condensation successes : 0
% 0.20/0.52 # Termbank termtop insertions : 11207
% 0.20/0.52
% 0.20/0.52 # -------------------------------------------------
% 0.20/0.52 # User time : 0.022 s
% 0.20/0.52 # System time : 0.001 s
% 0.20/0.52 # Total time : 0.023 s
% 0.20/0.52 # Maximum resident set size: 2048 pages
% 0.20/0.52
% 0.20/0.52 # -------------------------------------------------
% 0.20/0.52 # User time : 0.024 s
% 0.20/0.52 # System time : 0.003 s
% 0.20/0.52 # Total time : 0.027 s
% 0.20/0.52 # Maximum resident set size: 1712 pages
% 0.20/0.52 % E---3.1 exiting
% 0.20/0.52 % E---3.1 exiting
%------------------------------------------------------------------------------