TSTP Solution File: GEO028-2 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : GEO028-2 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n003.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:33:28 EDT 2023
% Result : Unsatisfiable 987.54s 127.93s
% Output : CNFRefutation 987.54s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 12
% Syntax : Number of clauses : 62 ( 28 unt; 15 nHn; 37 RR)
% Number of literals : 136 ( 26 equ; 63 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 : 8 ( 8 usr; 6 con; 0-5 aty)
% Number of variables : 223 ( 19 sgn)
% Comments :
%------------------------------------------------------------------------------
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.2vLNY0SXkP/E---3.1_31649.p',transitivity_for_equidistance) ).
cnf(segment_construction2,axiom,
equidistant(X1,extension(X2,X1,X3,X4),X3,X4),
file('/export/starexec/sandbox2/tmp/tmp.2vLNY0SXkP/E---3.1_31649.p',segment_construction2) ).
cnf(reflexivity_for_equidistance,axiom,
equidistant(X1,X2,X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.2vLNY0SXkP/E---3.1_31649.p',reflexivity_for_equidistance) ).
cnf(identity_for_equidistance,axiom,
( X1 = X2
| ~ equidistant(X1,X2,X3,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.2vLNY0SXkP/E---3.1_31649.p',identity_for_equidistance) ).
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.2vLNY0SXkP/E---3.1_31649.p',inner_pasch2) ).
cnf(segment_construction1,axiom,
between(X1,X2,extension(X1,X2,X3,X4)),
file('/export/starexec/sandbox2/tmp/tmp.2vLNY0SXkP/E---3.1_31649.p',segment_construction1) ).
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.2vLNY0SXkP/E---3.1_31649.p',inner_pasch1) ).
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.2vLNY0SXkP/E---3.1_31649.p',outer_five_segment) ).
cnf(identity_for_betweeness,axiom,
( X1 = X2
| ~ between(X1,X2,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.2vLNY0SXkP/E---3.1_31649.p',identity_for_betweeness) ).
cnf(w_to_x_equals_y_to_z,hypothesis,
equidistant(w,x,y,z),
file('/export/starexec/sandbox2/tmp/tmp.2vLNY0SXkP/E---3.1_31649.p',w_to_x_equals_y_to_z) ).
cnf(prove_equal_extensions,negated_conjecture,
extension(u,v,w,x) != extension(u,v,y,z),
file('/export/starexec/sandbox2/tmp/tmp.2vLNY0SXkP/E---3.1_31649.p',prove_equal_extensions) ).
cnf(u_not_v,hypothesis,
u != v,
file('/export/starexec/sandbox2/tmp/tmp.2vLNY0SXkP/E---3.1_31649.p',u_not_v) ).
cnf(c_0_12,axiom,
( equidistant(X3,X4,X5,X6)
| ~ equidistant(X1,X2,X3,X4)
| ~ equidistant(X1,X2,X5,X6) ),
transitivity_for_equidistance ).
cnf(c_0_13,axiom,
equidistant(X1,extension(X2,X1,X3,X4),X3,X4),
segment_construction2 ).
cnf(c_0_14,plain,
( equidistant(X1,X2,X3,X4)
| ~ equidistant(X5,extension(X6,X5,X3,X4),X1,X2) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_15,axiom,
equidistant(X1,X2,X2,X1),
reflexivity_for_equidistance ).
cnf(c_0_16,axiom,
( X1 = X2
| ~ equidistant(X1,X2,X3,X3) ),
identity_for_equidistance ).
cnf(c_0_17,plain,
equidistant(X1,X2,X1,X2),
inference(spm,[status(thm)],[c_0_14,c_0_13]) ).
cnf(c_0_18,plain,
( equidistant(X1,X2,X3,X4)
| ~ equidistant(X4,X3,X1,X2) ),
inference(spm,[status(thm)],[c_0_12,c_0_15]) ).
cnf(c_0_19,axiom,
( between(X5,inner_pasch(X1,X2,X3,X5,X4),X1)
| ~ between(X1,X2,X3)
| ~ between(X4,X5,X3) ),
inner_pasch2 ).
cnf(c_0_20,axiom,
between(X1,X2,extension(X1,X2,X3,X4)),
segment_construction1 ).
cnf(c_0_21,plain,
extension(X1,X2,X3,X3) = X2,
inference(spm,[status(thm)],[c_0_16,c_0_13]) ).
cnf(c_0_22,plain,
( equidistant(X1,X2,X3,X4)
| ~ equidistant(X3,X4,X1,X2) ),
inference(spm,[status(thm)],[c_0_12,c_0_17]) ).
cnf(c_0_23,plain,
equidistant(X1,X2,extension(X3,X4,X1,X2),X4),
inference(spm,[status(thm)],[c_0_18,c_0_13]) ).
cnf(c_0_24,axiom,
( between(X2,inner_pasch(X1,X2,X3,X5,X4),X4)
| ~ between(X1,X2,X3)
| ~ between(X4,X5,X3) ),
inner_pasch1 ).
cnf(c_0_25,plain,
( between(X1,inner_pasch(X2,X3,extension(X4,X1,X5,X6),X1,X4),X2)
| ~ between(X2,X3,extension(X4,X1,X5,X6)) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_26,plain,
between(X1,X2,X2),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_27,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_28,plain,
equidistant(X1,X2,X3,extension(X4,X3,X1,X2)),
inference(spm,[status(thm)],[c_0_22,c_0_13]) ).
cnf(c_0_29,plain,
( equidistant(X1,X2,extension(X3,X4,X5,X6),X4)
| ~ equidistant(X5,X6,X1,X2) ),
inference(spm,[status(thm)],[c_0_12,c_0_23]) ).
cnf(c_0_30,plain,
( between(X1,inner_pasch(X2,X1,extension(X3,X4,X5,X6),X4,X3),X3)
| ~ between(X2,X1,extension(X3,X4,X5,X6)) ),
inference(spm,[status(thm)],[c_0_24,c_0_20]) ).
cnf(c_0_31,axiom,
( X1 = X2
| ~ between(X1,X2,X1) ),
identity_for_betweeness ).
cnf(c_0_32,plain,
between(X1,inner_pasch(X2,extension(X3,X1,X4,X5),extension(X3,X1,X4,X5),X1,X3),X2),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_33,plain,
( X1 = X2
| equidistant(X3,X4,X5,extension(X6,X7,X2,X4))
| ~ between(X8,X7,X5)
| ~ between(X1,X2,X3)
| ~ equidistant(X1,X4,X8,extension(X6,X7,X2,X4))
| ~ equidistant(X2,X3,X7,X5)
| ~ equidistant(X1,X2,X8,X7) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_34,plain,
equidistant(X1,X1,X2,X2),
inference(spm,[status(thm)],[c_0_13,c_0_21]) ).
cnf(c_0_35,plain,
equidistant(X1,X2,extension(X3,X4,X2,X1),X4),
inference(spm,[status(thm)],[c_0_29,c_0_15]) ).
cnf(c_0_36,plain,
between(extension(X1,X2,X3,X4),inner_pasch(X5,extension(X1,X2,X3,X4),extension(X1,X2,X3,X4),X2,X1),X1),
inference(spm,[status(thm)],[c_0_30,c_0_26]) ).
cnf(c_0_37,plain,
inner_pasch(X1,extension(X2,X1,X3,X4),extension(X2,X1,X3,X4),X1,X2) = X1,
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_38,plain,
( X1 = X2
| equidistant(X3,X1,X4,extension(X5,X6,X2,X1))
| ~ between(extension(X5,X6,X2,X1),X6,X4)
| ~ between(X1,X2,X3)
| ~ equidistant(X2,X3,X6,X4) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35])]) ).
cnf(c_0_39,plain,
between(extension(X1,X2,X3,X4),X2,X1),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_40,hypothesis,
equidistant(w,x,y,z),
w_to_x_equals_y_to_z ).
cnf(c_0_41,plain,
( X1 = X2
| equidistant(X3,X1,X4,extension(X4,X5,X2,X1))
| ~ between(X1,X2,X3)
| ~ equidistant(X2,X3,X5,X4) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_42,hypothesis,
( equidistant(X1,X2,y,z)
| ~ equidistant(w,x,X1,X2) ),
inference(spm,[status(thm)],[c_0_12,c_0_40]) ).
cnf(c_0_43,plain,
( X1 = X2
| equidistant(extension(X3,X2,X4,X5),X1,X5,extension(X5,X4,X2,X1))
| ~ between(X1,X2,extension(X3,X2,X4,X5)) ),
inference(spm,[status(thm)],[c_0_41,c_0_13]) ).
cnf(c_0_44,hypothesis,
equidistant(x,w,y,z),
inference(spm,[status(thm)],[c_0_42,c_0_15]) ).
cnf(c_0_45,plain,
( X1 = X2
| equidistant(extension(X1,X2,X3,X4),X1,X4,extension(X4,X3,X2,X1)) ),
inference(spm,[status(thm)],[c_0_43,c_0_20]) ).
cnf(c_0_46,hypothesis,
equidistant(y,z,w,x),
inference(spm,[status(thm)],[c_0_18,c_0_44]) ).
cnf(c_0_47,plain,
( X1 = X2
| equidistant(X3,extension(X3,X4,X2,X1),X1,extension(X1,X2,X4,X3)) ),
inference(spm,[status(thm)],[c_0_18,c_0_45]) ).
cnf(c_0_48,hypothesis,
( equidistant(X1,X2,w,x)
| ~ equidistant(y,z,X1,X2) ),
inference(spm,[status(thm)],[c_0_12,c_0_46]) ).
cnf(c_0_49,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_27,c_0_13]) ).
cnf(c_0_50,plain,
( X1 = X2
| equidistant(X1,extension(X1,X2,X3,X4),extension(X4,X3,X2,X1),X4) ),
inference(spm,[status(thm)],[c_0_18,c_0_47]) ).
cnf(c_0_51,hypothesis,
equidistant(extension(X1,X2,y,z),X2,w,x),
inference(spm,[status(thm)],[c_0_48,c_0_23]) ).
cnf(c_0_52,plain,
( X1 = X2
| equidistant(X3,extension(X1,X2,X4,X5),X6,X5)
| ~ between(extension(X5,X4,X2,X1),X4,X6)
| ~ between(X1,X2,X3)
| ~ equidistant(X2,X3,X4,X6) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_35])]) ).
cnf(c_0_53,hypothesis,
( equidistant(X1,X2,w,x)
| ~ equidistant(extension(X3,X4,y,z),X4,X1,X2) ),
inference(spm,[status(thm)],[c_0_12,c_0_51]) ).
cnf(c_0_54,plain,
( X1 = X2
| equidistant(X3,extension(X1,X2,X4,X5),X5,X5)
| ~ between(X1,X2,X3)
| ~ equidistant(X2,X3,X4,X5) ),
inference(spm,[status(thm)],[c_0_52,c_0_39]) ).
cnf(c_0_55,hypothesis,
equidistant(X1,extension(X2,X1,y,z),w,x),
inference(spm,[status(thm)],[c_0_53,c_0_15]) ).
cnf(c_0_56,hypothesis,
( X1 = X2
| equidistant(extension(X3,X2,y,z),extension(X1,X2,w,x),x,x)
| ~ between(X1,X2,extension(X3,X2,y,z)) ),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_57,hypothesis,
( X1 = X2
| equidistant(extension(X1,X2,y,z),extension(X1,X2,w,x),x,x) ),
inference(spm,[status(thm)],[c_0_56,c_0_20]) ).
cnf(c_0_58,negated_conjecture,
extension(u,v,w,x) != extension(u,v,y,z),
prove_equal_extensions ).
cnf(c_0_59,hypothesis,
( extension(X1,X2,y,z) = extension(X1,X2,w,x)
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_16,c_0_57]) ).
cnf(c_0_60,hypothesis,
u != v,
u_not_v ).
cnf(c_0_61,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_60]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GEO028-2 : TPTP v8.1.2. Released v1.0.0.
% 0.11/0.13 % Command : run_E %s %d THM
% 0.12/0.34 % Computer : n003.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.35 % CPULimit : 2400
% 0.12/0.35 % WCLimit : 300
% 0.12/0.35 % DateTime : Tue Oct 3 07:00:48 EDT 2023
% 0.12/0.35 % CPUTime :
% 0.19/0.48 Running first-order model finding
% 0.19/0.48 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.2vLNY0SXkP/E---3.1_31649.p
% 987.54/127.93 # Version: 3.1pre001
% 987.54/127.93 # Preprocessing class: FSMSSMSMSSSNFFN.
% 987.54/127.93 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 987.54/127.93 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 987.54/127.93 # Starting new_bool_3 with 300s (1) cores
% 987.54/127.93 # Starting new_bool_1 with 300s (1) cores
% 987.54/127.93 # Starting sh5l with 300s (1) cores
% 987.54/127.93 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 31727 completed with status 0
% 987.54/127.93 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 987.54/127.93 # Preprocessing class: FSMSSMSMSSSNFFN.
% 987.54/127.93 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 987.54/127.93 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 987.54/127.93 # No SInE strategy applied
% 987.54/127.93 # Search class: FGUSS-FFMF33-SFFFFFNN
% 987.54/127.93 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 987.54/127.93 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with 888s (1) cores
% 987.54/127.93 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 987.54/127.93 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 136s (1) cores
% 987.54/127.93 # Starting 208_C09_12_F1_SE_CS_SP_PS_S070I with 136s (1) cores
% 987.54/127.93 # Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 987.54/127.93 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 31733 completed with status 0
% 987.54/127.93 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 987.54/127.93 # Preprocessing class: FSMSSMSMSSSNFFN.
% 987.54/127.93 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 987.54/127.93 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 987.54/127.93 # No SInE strategy applied
% 987.54/127.93 # Search class: FGUSS-FFMF33-SFFFFFNN
% 987.54/127.93 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 987.54/127.93 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with 888s (1) cores
% 987.54/127.93 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 987.54/127.93 # Preprocessing time : 0.001 s
% 987.54/127.93 # Presaturation interreduction done
% 987.54/127.93
% 987.54/127.93 # Proof found!
% 987.54/127.93 # SZS status Unsatisfiable
% 987.54/127.93 # SZS output start CNFRefutation
% See solution above
% 987.54/127.93 # Parsed axioms : 21
% 987.54/127.93 # Removed by relevancy pruning/SinE : 0
% 987.54/127.93 # Initial clauses : 21
% 987.54/127.93 # Removed in clause preprocessing : 0
% 987.54/127.93 # Initial clauses in saturation : 21
% 987.54/127.93 # Processed clauses : 175855
% 987.54/127.93 # ...of these trivial : 9018
% 987.54/127.93 # ...subsumed : 146071
% 987.54/127.93 # ...remaining for further processing : 20766
% 987.54/127.93 # Other redundant clauses eliminated : 0
% 987.54/127.93 # Clauses deleted for lack of memory : 419825
% 987.54/127.93 # Backward-subsumed : 3746
% 987.54/127.93 # Backward-rewritten : 641
% 987.54/127.93 # Generated clauses : 4073200
% 987.54/127.93 # ...of the previous two non-redundant : 3759584
% 987.54/127.93 # ...aggressively subsumed : 0
% 987.54/127.93 # Contextual simplify-reflections : 0
% 987.54/127.93 # Paramodulations : 4073200
% 987.54/127.93 # Factorizations : 0
% 987.54/127.93 # NegExts : 0
% 987.54/127.93 # Equation resolutions : 0
% 987.54/127.93 # Total rewrite steps : 631433
% 987.54/127.93 # Propositional unsat checks : 0
% 987.54/127.93 # Propositional check models : 0
% 987.54/127.93 # Propositional check unsatisfiable : 0
% 987.54/127.93 # Propositional clauses : 0
% 987.54/127.93 # Propositional clauses after purity: 0
% 987.54/127.93 # Propositional unsat core size : 0
% 987.54/127.93 # Propositional preprocessing time : 0.000
% 987.54/127.93 # Propositional encoding time : 0.000
% 987.54/127.93 # Propositional solver time : 0.000
% 987.54/127.93 # Success case prop preproc time : 0.000
% 987.54/127.93 # Success case prop encoding time : 0.000
% 987.54/127.93 # Success case prop solver time : 0.000
% 987.54/127.93 # Current number of processed clauses : 16358
% 987.54/127.93 # Positive orientable unit clauses : 6202
% 987.54/127.93 # Positive unorientable unit clauses: 0
% 987.54/127.93 # Negative unit clauses : 5
% 987.54/127.93 # Non-unit-clauses : 10151
% 987.54/127.93 # Current number of unprocessed clauses: 1554282
% 987.54/127.93 # ...number of literals in the above : 4312623
% 987.54/127.93 # Current number of archived formulas : 0
% 987.54/127.93 # Current number of archived clauses : 4408
% 987.54/127.93 # Clause-clause subsumption calls (NU) : 109047905
% 987.54/127.93 # Rec. Clause-clause subsumption calls : 44512281
% 987.54/127.93 # Non-unit clause-clause subsumptions : 149817
% 987.54/127.93 # Unit Clause-clause subsumption calls : 4619747
% 987.54/127.93 # Rewrite failures with RHS unbound : 0
% 987.54/127.93 # BW rewrite match attempts : 8254096
% 987.54/127.93 # BW rewrite match successes : 607
% 987.54/127.93 # Condensation attempts : 0
% 987.54/127.93 # Condensation successes : 0
% 987.54/127.93 # Termbank termtop insertions : 197395972
% 987.54/127.93
% 987.54/127.93 # -------------------------------------------------
% 987.54/127.93 # User time : 121.386 s
% 987.54/127.93 # System time : 1.838 s
% 987.54/127.93 # Total time : 123.224 s
% 987.54/127.93 # Maximum resident set size: 1640 pages
% 987.54/127.93
% 987.54/127.93 # -------------------------------------------------
% 987.54/127.93 # User time : 605.886 s
% 987.54/127.93 # System time : 9.166 s
% 987.54/127.93 # Total time : 615.052 s
% 987.54/127.93 # Maximum resident set size: 1692 pages
% 987.54/127.93 % E---3.1 exiting
%------------------------------------------------------------------------------