TSTP Solution File: GEO029-2 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GEO029-2 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n020.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:10 EDT 2023
% Result : Unsatisfiable 17.89s 2.87s
% Output : CNFRefutation 17.89s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 11
% Syntax : Number of clauses : 44 ( 21 unt; 8 nHn; 27 RR)
% Number of literals : 100 ( 23 equ; 52 neg)
% Maximal clause size : 8 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-4 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-5 aty)
% Number of variables : 160 ( 16 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(identity_for_equidistance,axiom,
( X1 = X2
| ~ equidistant(X1,X2,X3,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.UzF44NlHQt/E---3.1_21870.p',identity_for_equidistance) ).
cnf(segment_construction2,axiom,
equidistant(X1,extension(X2,X1,X3,X4),X3,X4),
file('/export/starexec/sandbox2/tmp/tmp.UzF44NlHQt/E---3.1_21870.p',segment_construction2) ).
cnf(identity_for_betweeness,axiom,
( X1 = X2
| ~ between(X1,X2,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.UzF44NlHQt/E---3.1_21870.p',identity_for_betweeness) ).
cnf(inner_pasch1,axiom,
( between(X2,inner_pasch(X1,X2,X3,X5,X4),X4)
| ~ between(X1,X2,X3)
| ~ between(X4,X5,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.UzF44NlHQt/E---3.1_21870.p',inner_pasch1) ).
cnf(segment_construction1,axiom,
between(X1,X2,extension(X1,X2,X3,X4)),
file('/export/starexec/sandbox2/tmp/tmp.UzF44NlHQt/E---3.1_21870.p',segment_construction1) ).
cnf(transitivity_for_equidistance,axiom,
( equidistant(X3,X4,X5,X6)
| ~ equidistant(X1,X2,X3,X4)
| ~ equidistant(X1,X2,X5,X6) ),
file('/export/starexec/sandbox2/tmp/tmp.UzF44NlHQt/E---3.1_21870.p',transitivity_for_equidistance) ).
cnf(reflexivity_for_equidistance,axiom,
equidistant(X1,X2,X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.UzF44NlHQt/E---3.1_21870.p',reflexivity_for_equidistance) ).
cnf(outer_five_segment,axiom,
( X1 = X2
| equidistant(X5,X7,X6,X8)
| ~ equidistant(X1,X2,X3,X4)
| ~ equidistant(X2,X5,X4,X6)
| ~ equidistant(X1,X7,X3,X8)
| ~ equidistant(X2,X7,X4,X8)
| ~ between(X1,X2,X5)
| ~ between(X3,X4,X6) ),
file('/export/starexec/sandbox2/tmp/tmp.UzF44NlHQt/E---3.1_21870.p',outer_five_segment) ).
cnf(inner_pasch2,axiom,
( between(X5,inner_pasch(X1,X2,X3,X5,X4),X1)
| ~ between(X1,X2,X3)
| ~ between(X4,X5,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.UzF44NlHQt/E---3.1_21870.p',inner_pasch2) ).
cnf(prove_equal_extensions,negated_conjecture,
extension(u,v,u,v) != extension(u,v,v,u),
file('/export/starexec/sandbox2/tmp/tmp.UzF44NlHQt/E---3.1_21870.p',prove_equal_extensions) ).
cnf(u_not_v,hypothesis,
u != v,
file('/export/starexec/sandbox2/tmp/tmp.UzF44NlHQt/E---3.1_21870.p',u_not_v) ).
cnf(c_0_11,axiom,
( X1 = X2
| ~ equidistant(X1,X2,X3,X3) ),
identity_for_equidistance ).
cnf(c_0_12,axiom,
equidistant(X1,extension(X2,X1,X3,X4),X3,X4),
segment_construction2 ).
cnf(c_0_13,axiom,
( X1 = X2
| ~ between(X1,X2,X1) ),
identity_for_betweeness ).
cnf(c_0_14,axiom,
( between(X2,inner_pasch(X1,X2,X3,X5,X4),X4)
| ~ between(X1,X2,X3)
| ~ between(X4,X5,X3) ),
inner_pasch1 ).
cnf(c_0_15,axiom,
between(X1,X2,extension(X1,X2,X3,X4)),
segment_construction1 ).
cnf(c_0_16,plain,
extension(X1,X2,X3,X3) = X2,
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_17,axiom,
( equidistant(X3,X4,X5,X6)
| ~ equidistant(X1,X2,X3,X4)
| ~ equidistant(X1,X2,X5,X6) ),
transitivity_for_equidistance ).
cnf(c_0_18,axiom,
equidistant(X1,X2,X2,X1),
reflexivity_for_equidistance ).
cnf(c_0_19,plain,
( inner_pasch(X1,X2,X3,X4,X2) = X2
| ~ between(X2,X4,X3)
| ~ between(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_20,plain,
between(X1,X2,X2),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,plain,
( equidistant(X1,X2,X3,X4)
| ~ equidistant(X5,extension(X6,X5,X3,X4),X1,X2) ),
inference(spm,[status(thm)],[c_0_17,c_0_12]) ).
cnf(c_0_22,plain,
( equidistant(X1,X2,X3,X4)
| ~ equidistant(X4,X3,X1,X2) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_23,axiom,
( X1 = X2
| equidistant(X5,X7,X6,X8)
| ~ equidistant(X1,X2,X3,X4)
| ~ equidistant(X2,X5,X4,X6)
| ~ equidistant(X1,X7,X3,X8)
| ~ equidistant(X2,X7,X4,X8)
| ~ between(X1,X2,X5)
| ~ between(X3,X4,X6) ),
outer_five_segment ).
cnf(c_0_24,plain,
( inner_pasch(X1,X2,X3,X3,X2) = X2
| ~ between(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,plain,
equidistant(X1,X2,X1,X2),
inference(spm,[status(thm)],[c_0_21,c_0_12]) ).
cnf(c_0_26,plain,
equidistant(X1,X2,extension(X3,X4,X1,X2),X4),
inference(spm,[status(thm)],[c_0_22,c_0_12]) ).
cnf(c_0_27,plain,
( X1 = X2
| equidistant(X3,extension(X4,X2,X5,X6),X7,X6)
| ~ between(X8,X5,X7)
| ~ between(X1,X2,X3)
| ~ equidistant(X1,extension(X4,X2,X5,X6),X8,X6)
| ~ equidistant(X2,X3,X5,X7)
| ~ equidistant(X1,X2,X8,X5) ),
inference(spm,[status(thm)],[c_0_23,c_0_12]) ).
cnf(c_0_28,axiom,
( between(X5,inner_pasch(X1,X2,X3,X5,X4),X1)
| ~ between(X1,X2,X3)
| ~ between(X4,X5,X3) ),
inner_pasch2 ).
cnf(c_0_29,plain,
inner_pasch(X1,X2,extension(X1,X2,X3,X4),extension(X1,X2,X3,X4),X2) = X2,
inference(spm,[status(thm)],[c_0_24,c_0_15]) ).
cnf(c_0_30,plain,
( equidistant(X1,X2,X3,X4)
| ~ equidistant(X3,X4,X1,X2) ),
inference(spm,[status(thm)],[c_0_17,c_0_25]) ).
cnf(c_0_31,plain,
equidistant(extension(X1,X2,X3,X4),X2,X4,X3),
inference(spm,[status(thm)],[c_0_22,c_0_26]) ).
cnf(c_0_32,plain,
( X1 = X2
| equidistant(X3,extension(X4,X2,X5,X1),X6,X1)
| ~ between(extension(X4,X2,X5,X1),X5,X6)
| ~ between(X1,X2,X3)
| ~ equidistant(X1,X2,extension(X4,X2,X5,X1),X5)
| ~ equidistant(X2,X3,X5,X6) ),
inference(spm,[status(thm)],[c_0_27,c_0_18]) ).
cnf(c_0_33,plain,
between(extension(X1,X2,X3,X4),X2,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_20]),c_0_15])]) ).
cnf(c_0_34,plain,
equidistant(X1,X2,extension(X3,X4,X2,X1),X4),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_35,plain,
( X1 = X2
| equidistant(X3,extension(X4,X2,X2,X1),X4,X1)
| ~ between(X1,X2,X3)
| ~ equidistant(X2,X3,X2,X4) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34])]) ).
cnf(c_0_36,plain,
equidistant(X1,X2,X3,extension(X4,X3,X1,X2)),
inference(spm,[status(thm)],[c_0_30,c_0_12]) ).
cnf(c_0_37,plain,
( X1 = extension(X2,X3,X3,X2)
| X2 = X3
| ~ between(X2,X3,X1)
| ~ equidistant(X3,X1,X3,X2) ),
inference(spm,[status(thm)],[c_0_11,c_0_35]) ).
cnf(c_0_38,plain,
equidistant(X1,extension(X2,X1,X3,X4),X4,X3),
inference(spm,[status(thm)],[c_0_22,c_0_36]) ).
cnf(c_0_39,plain,
( extension(X1,X2,X3,X2) = extension(X3,X2,X2,X3)
| X3 = X2
| ~ between(X3,X2,extension(X1,X2,X3,X2)) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_40,negated_conjecture,
extension(u,v,u,v) != extension(u,v,v,u),
prove_equal_extensions ).
cnf(c_0_41,plain,
( extension(X1,X2,X1,X2) = extension(X1,X2,X2,X1)
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_39,c_0_15]) ).
cnf(c_0_42,hypothesis,
u != v,
u_not_v ).
cnf(c_0_43,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : GEO029-2 : TPTP v8.1.2. Released v1.0.0.
% 0.12/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n020.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 2400
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Tue Oct 3 06:23:16 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 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.UzF44NlHQt/E---3.1_21870.p
% 17.89/2.87 # Version: 3.1pre001
% 17.89/2.87 # Preprocessing class: FSMSSMSSSSSNFFN.
% 17.89/2.87 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 17.89/2.87 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 17.89/2.87 # Starting new_bool_3 with 300s (1) cores
% 17.89/2.87 # Starting new_bool_1 with 300s (1) cores
% 17.89/2.87 # Starting sh5l with 300s (1) cores
% 17.89/2.87 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 21951 completed with status 0
% 17.89/2.87 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 17.89/2.87 # Preprocessing class: FSMSSMSSSSSNFFN.
% 17.89/2.87 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 17.89/2.87 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 17.89/2.87 # No SInE strategy applied
% 17.89/2.87 # Search class: FGUSS-FFMF33-SFFFFFNN
% 17.89/2.87 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 17.89/2.87 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with 888s (1) cores
% 17.89/2.87 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 17.89/2.87 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 136s (1) cores
% 17.89/2.87 # Starting 208_C09_12_F1_SE_CS_SP_PS_S070I with 136s (1) cores
% 17.89/2.87 # Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 17.89/2.87 # G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with pid 21955 completed with status 0
% 17.89/2.87 # Result found by G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I
% 17.89/2.87 # Preprocessing class: FSMSSMSSSSSNFFN.
% 17.89/2.87 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 17.89/2.87 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 17.89/2.87 # No SInE strategy applied
% 17.89/2.87 # Search class: FGUSS-FFMF33-SFFFFFNN
% 17.89/2.87 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 17.89/2.87 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with 888s (1) cores
% 17.89/2.87 # Preprocessing time : 0.002 s
% 17.89/2.87
% 17.89/2.87 # Proof found!
% 17.89/2.87 # SZS status Unsatisfiable
% 17.89/2.87 # SZS output start CNFRefutation
% See solution above
% 17.89/2.87 # Parsed axioms : 20
% 17.89/2.87 # Removed by relevancy pruning/SinE : 0
% 17.89/2.87 # Initial clauses : 20
% 17.89/2.87 # Removed in clause preprocessing : 0
% 17.89/2.87 # Initial clauses in saturation : 20
% 17.89/2.87 # Processed clauses : 5846
% 17.89/2.87 # ...of these trivial : 360
% 17.89/2.87 # ...subsumed : 3781
% 17.89/2.87 # ...remaining for further processing : 1705
% 17.89/2.87 # Other redundant clauses eliminated : 0
% 17.89/2.87 # Clauses deleted for lack of memory : 0
% 17.89/2.87 # Backward-subsumed : 24
% 17.89/2.87 # Backward-rewritten : 4
% 17.89/2.87 # Generated clauses : 92401
% 17.89/2.87 # ...of the previous two non-redundant : 83264
% 17.89/2.87 # ...aggressively subsumed : 0
% 17.89/2.87 # Contextual simplify-reflections : 2
% 17.89/2.87 # Paramodulations : 92401
% 17.89/2.87 # Factorizations : 0
% 17.89/2.87 # NegExts : 0
% 17.89/2.87 # Equation resolutions : 0
% 17.89/2.87 # Total rewrite steps : 57798
% 17.89/2.87 # Propositional unsat checks : 0
% 17.89/2.87 # Propositional check models : 0
% 17.89/2.87 # Propositional check unsatisfiable : 0
% 17.89/2.87 # Propositional clauses : 0
% 17.89/2.87 # Propositional clauses after purity: 0
% 17.89/2.87 # Propositional unsat core size : 0
% 17.89/2.87 # Propositional preprocessing time : 0.000
% 17.89/2.87 # Propositional encoding time : 0.000
% 17.89/2.87 # Propositional solver time : 0.000
% 17.89/2.87 # Success case prop preproc time : 0.000
% 17.89/2.87 # Success case prop encoding time : 0.000
% 17.89/2.87 # Success case prop solver time : 0.000
% 17.89/2.87 # Current number of processed clauses : 1677
% 17.89/2.87 # Positive orientable unit clauses : 164
% 17.89/2.87 # Positive unorientable unit clauses: 0
% 17.89/2.87 # Negative unit clauses : 5
% 17.89/2.87 # Non-unit-clauses : 1508
% 17.89/2.87 # Current number of unprocessed clauses: 76486
% 17.89/2.87 # ...number of literals in the above : 432324
% 17.89/2.87 # Current number of archived formulas : 0
% 17.89/2.87 # Current number of archived clauses : 28
% 17.89/2.87 # Clause-clause subsumption calls (NU) : 1026522
% 17.89/2.87 # Rec. Clause-clause subsumption calls : 241857
% 17.89/2.87 # Non-unit clause-clause subsumptions : 3807
% 17.89/2.87 # Unit Clause-clause subsumption calls : 7162
% 17.89/2.87 # Rewrite failures with RHS unbound : 0
% 17.89/2.87 # BW rewrite match attempts : 29761
% 17.89/2.87 # BW rewrite match successes : 3
% 17.89/2.87 # Condensation attempts : 0
% 17.89/2.87 # Condensation successes : 0
% 17.89/2.87 # Termbank termtop insertions : 1865767
% 17.89/2.87
% 17.89/2.87 # -------------------------------------------------
% 17.89/2.87 # User time : 2.162 s
% 17.89/2.87 # System time : 0.057 s
% 17.89/2.87 # Total time : 2.219 s
% 17.89/2.87 # Maximum resident set size: 1636 pages
% 17.89/2.87
% 17.89/2.87 # -------------------------------------------------
% 17.89/2.87 # User time : 10.916 s
% 17.89/2.87 # System time : 0.336 s
% 17.89/2.87 # Total time : 11.252 s
% 17.89/2.87 # Maximum resident set size: 1692 pages
% 17.89/2.87 % E---3.1 exiting
% 17.89/2.87 % E---3.1 exiting
%------------------------------------------------------------------------------