TSTP Solution File: GEO047-2 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : GEO047-2 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n017.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:33 EDT 2023
% Result : Unsatisfiable 29.91s 4.29s
% Output : CNFRefutation 29.91s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 12
% Syntax : Number of clauses : 52 ( 27 unt; 7 nHn; 38 RR)
% Number of literals : 109 ( 26 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 : 6 ( 6 usr; 4 con; 0-5 aty)
% Number of variables : 132 ( 14 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(identity_for_betweeness,axiom,
( X1 = X2
| ~ between(X1,X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.QMKN0J9Qdg/E---3.1_30952.p',identity_for_betweeness) ).
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/sandbox/tmp/tmp.QMKN0J9Qdg/E---3.1_30952.p',inner_pasch2) ).
cnf(identity_for_equidistance,axiom,
( X1 = X2
| ~ equidistant(X1,X2,X3,X3) ),
file('/export/starexec/sandbox/tmp/tmp.QMKN0J9Qdg/E---3.1_30952.p',identity_for_equidistance) ).
cnf(segment_construction2,axiom,
equidistant(X1,extension(X2,X1,X3,X4),X3,X4),
file('/export/starexec/sandbox/tmp/tmp.QMKN0J9Qdg/E---3.1_30952.p',segment_construction2) ).
cnf(w_between_u_and_x,hypothesis,
between(u,w,x),
file('/export/starexec/sandbox/tmp/tmp.QMKN0J9Qdg/E---3.1_30952.p',w_between_u_and_x) ).
cnf(segment_construction1,axiom,
between(X1,X2,extension(X1,X2,X3,X4)),
file('/export/starexec/sandbox/tmp/tmp.QMKN0J9Qdg/E---3.1_30952.p',segment_construction1) ).
cnf(v_between_u_and_w,hypothesis,
between(u,v,w),
file('/export/starexec/sandbox/tmp/tmp.QMKN0J9Qdg/E---3.1_30952.p',v_between_u_and_w) ).
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/sandbox/tmp/tmp.QMKN0J9Qdg/E---3.1_30952.p',inner_pasch1) ).
cnf(transitivity_for_equidistance,axiom,
( equidistant(X3,X4,X5,X6)
| ~ equidistant(X1,X2,X3,X4)
| ~ equidistant(X1,X2,X5,X6) ),
file('/export/starexec/sandbox/tmp/tmp.QMKN0J9Qdg/E---3.1_30952.p',transitivity_for_equidistance) ).
cnf(reflexivity_for_equidistance,axiom,
equidistant(X1,X2,X2,X1),
file('/export/starexec/sandbox/tmp/tmp.QMKN0J9Qdg/E---3.1_30952.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/sandbox/tmp/tmp.QMKN0J9Qdg/E---3.1_30952.p',outer_five_segment) ).
cnf(prove_v_between_u_and_x,negated_conjecture,
~ between(u,v,x),
file('/export/starexec/sandbox/tmp/tmp.QMKN0J9Qdg/E---3.1_30952.p',prove_v_between_u_and_x) ).
cnf(c_0_12,axiom,
( X1 = X2
| ~ between(X1,X2,X1) ),
identity_for_betweeness ).
cnf(c_0_13,axiom,
( between(X5,inner_pasch(X1,X2,X3,X5,X4),X1)
| ~ between(X1,X2,X3)
| ~ between(X4,X5,X3) ),
inner_pasch2 ).
cnf(c_0_14,axiom,
( X1 = X2
| ~ equidistant(X1,X2,X3,X3) ),
identity_for_equidistance ).
cnf(c_0_15,axiom,
equidistant(X1,extension(X2,X1,X3,X4),X3,X4),
segment_construction2 ).
cnf(c_0_16,plain,
( inner_pasch(X1,X2,X3,X1,X4) = X1
| ~ between(X4,X1,X3)
| ~ between(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,hypothesis,
between(u,w,x),
w_between_u_and_x ).
cnf(c_0_18,axiom,
between(X1,X2,extension(X1,X2,X3,X4)),
segment_construction1 ).
cnf(c_0_19,plain,
extension(X1,X2,X3,X3) = X2,
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,hypothesis,
( inner_pasch(w,X1,x,w,u) = w
| ~ between(w,X1,x) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,plain,
between(X1,X2,X2),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,hypothesis,
between(u,v,w),
v_between_u_and_w ).
cnf(c_0_23,axiom,
( between(X2,inner_pasch(X1,X2,X3,X5,X4),X4)
| ~ between(X1,X2,X3)
| ~ between(X4,X5,X3) ),
inner_pasch1 ).
cnf(c_0_24,hypothesis,
inner_pasch(w,x,x,w,u) = w,
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,hypothesis,
( inner_pasch(v,X1,w,v,u) = v
| ~ between(v,X1,w) ),
inference(spm,[status(thm)],[c_0_16,c_0_22]) ).
cnf(c_0_26,hypothesis,
between(x,w,u),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_17]),c_0_21])]) ).
cnf(c_0_27,hypothesis,
inner_pasch(v,w,w,v,u) = v,
inference(spm,[status(thm)],[c_0_25,c_0_21]) ).
cnf(c_0_28,hypothesis,
( inner_pasch(w,X1,u,w,x) = w
| ~ between(w,X1,u) ),
inference(spm,[status(thm)],[c_0_16,c_0_26]) ).
cnf(c_0_29,hypothesis,
between(w,v,u),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_27]),c_0_22]),c_0_21])]) ).
cnf(c_0_30,plain,
( inner_pasch(X1,X2,X3,X4,X2) = X2
| ~ between(X2,X4,X3)
| ~ between(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_12,c_0_23]) ).
cnf(c_0_31,axiom,
( equidistant(X3,X4,X5,X6)
| ~ equidistant(X1,X2,X3,X4)
| ~ equidistant(X1,X2,X5,X6) ),
transitivity_for_equidistance ).
cnf(c_0_32,axiom,
equidistant(X1,X2,X2,X1),
reflexivity_for_equidistance ).
cnf(c_0_33,hypothesis,
inner_pasch(w,v,u,w,x) = w,
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_34,plain,
( inner_pasch(X1,X2,X3,X3,X2) = X2
| ~ between(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_30,c_0_21]) ).
cnf(c_0_35,plain,
( equidistant(X1,X2,X3,X4)
| ~ equidistant(X4,X3,X1,X2) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_36,hypothesis,
between(v,w,x),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_33]),c_0_26]),c_0_29])]) ).
cnf(c_0_37,plain,
inner_pasch(X1,X2,extension(X1,X2,X3,X4),extension(X1,X2,X3,X4),X2) = X2,
inference(spm,[status(thm)],[c_0_34,c_0_18]) ).
cnf(c_0_38,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_39,plain,
equidistant(X1,X2,X1,X2),
inference(spm,[status(thm)],[c_0_35,c_0_32]) ).
cnf(c_0_40,hypothesis,
( inner_pasch(X1,v,x,w,v) = v
| ~ between(X1,v,x) ),
inference(spm,[status(thm)],[c_0_30,c_0_36]) ).
cnf(c_0_41,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_13,c_0_37]),c_0_21]),c_0_18])]) ).
cnf(c_0_42,plain,
( X1 = X2
| equidistant(X3,X4,X5,X4)
| ~ between(X6,X2,X5)
| ~ between(X1,X2,X3)
| ~ equidistant(X2,X3,X2,X5)
| ~ equidistant(X1,X4,X6,X4)
| ~ equidistant(X1,X2,X6,X2) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_43,hypothesis,
inner_pasch(extension(x,v,X1,X2),v,x,w,v) = v,
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_44,plain,
( X1 = X2
| equidistant(extension(X3,X2,X2,X4),X5,X4,X5)
| ~ between(X1,X2,extension(X3,X2,X2,X4))
| ~ between(X6,X2,X4)
| ~ equidistant(X1,X5,X6,X5)
| ~ equidistant(X1,X2,X6,X2) ),
inference(spm,[status(thm)],[c_0_42,c_0_15]) ).
cnf(c_0_45,hypothesis,
between(w,v,extension(x,v,X1,X2)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_43]),c_0_36]),c_0_41])]) ).
cnf(c_0_46,hypothesis,
( w = v
| equidistant(extension(x,v,v,X1),X2,X1,X2)
| ~ between(X3,v,X1)
| ~ equidistant(w,v,X3,v)
| ~ equidistant(w,X2,X3,X2) ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_47,hypothesis,
( w = v
| equidistant(extension(x,v,v,u),X1,u,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_29]),c_0_39]),c_0_39])]) ).
cnf(c_0_48,hypothesis,
( extension(x,v,v,u) = u
| w = v ),
inference(spm,[status(thm)],[c_0_14,c_0_47]) ).
cnf(c_0_49,negated_conjecture,
~ between(u,v,x),
prove_v_between_u_and_x ).
cnf(c_0_50,hypothesis,
w = v,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_48]),c_0_49]) ).
cnf(c_0_51,hypothesis,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_50]),c_0_49]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : GEO047-2 : TPTP v8.1.2. Released v1.0.0.
% 0.03/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n017.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 05:59:56 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.20/0.49 Running first-order model finding
% 0.20/0.49 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.QMKN0J9Qdg/E---3.1_30952.p
% 29.91/4.29 # Version: 3.1pre001
% 29.91/4.29 # Preprocessing class: FSMSSMSSSSSNFFN.
% 29.91/4.29 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 29.91/4.29 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 29.91/4.29 # Starting new_bool_3 with 300s (1) cores
% 29.91/4.29 # Starting new_bool_1 with 300s (1) cores
% 29.91/4.29 # Starting sh5l with 300s (1) cores
% 29.91/4.29 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 31029 completed with status 0
% 29.91/4.29 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 29.91/4.29 # Preprocessing class: FSMSSMSSSSSNFFN.
% 29.91/4.29 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 29.91/4.29 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 29.91/4.29 # No SInE strategy applied
% 29.91/4.29 # Search class: FGUSS-FFMF33-SFFFFFNN
% 29.91/4.29 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 29.91/4.29 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with 888s (1) cores
% 29.91/4.29 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 29.91/4.29 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 136s (1) cores
% 29.91/4.29 # Starting 208_C09_12_F1_SE_CS_SP_PS_S070I with 136s (1) cores
% 29.91/4.29 # Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 29.91/4.29 # G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with pid 31035 completed with status 0
% 29.91/4.29 # Result found by G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I
% 29.91/4.29 # Preprocessing class: FSMSSMSSSSSNFFN.
% 29.91/4.29 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 29.91/4.29 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 29.91/4.29 # No SInE strategy applied
% 29.91/4.29 # Search class: FGUSS-FFMF33-SFFFFFNN
% 29.91/4.29 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 29.91/4.29 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with 888s (1) cores
% 29.91/4.29 # Preprocessing time : 0.002 s
% 29.91/4.29
% 29.91/4.29 # Proof found!
% 29.91/4.29 # SZS status Unsatisfiable
% 29.91/4.29 # SZS output start CNFRefutation
% See solution above
% 29.91/4.29 # Parsed axioms : 21
% 29.91/4.29 # Removed by relevancy pruning/SinE : 0
% 29.91/4.29 # Initial clauses : 21
% 29.91/4.29 # Removed in clause preprocessing : 0
% 29.91/4.29 # Initial clauses in saturation : 21
% 29.91/4.29 # Processed clauses : 4853
% 29.91/4.29 # ...of these trivial : 229
% 29.91/4.29 # ...subsumed : 1551
% 29.91/4.29 # ...remaining for further processing : 3073
% 29.91/4.29 # Other redundant clauses eliminated : 0
% 29.91/4.29 # Clauses deleted for lack of memory : 0
% 29.91/4.29 # Backward-subsumed : 109
% 29.91/4.29 # Backward-rewritten : 1890
% 29.91/4.29 # Generated clauses : 123751
% 29.91/4.29 # ...of the previous two non-redundant : 118918
% 29.91/4.29 # ...aggressively subsumed : 0
% 29.91/4.29 # Contextual simplify-reflections : 6
% 29.91/4.29 # Paramodulations : 123751
% 29.91/4.29 # Factorizations : 0
% 29.91/4.29 # NegExts : 0
% 29.91/4.29 # Equation resolutions : 0
% 29.91/4.29 # Total rewrite steps : 56410
% 29.91/4.29 # Propositional unsat checks : 0
% 29.91/4.30 # Propositional check models : 0
% 29.91/4.30 # Propositional check unsatisfiable : 0
% 29.91/4.30 # Propositional clauses : 0
% 29.91/4.30 # Propositional clauses after purity: 0
% 29.91/4.30 # Propositional unsat core size : 0
% 29.91/4.30 # Propositional preprocessing time : 0.000
% 29.91/4.30 # Propositional encoding time : 0.000
% 29.91/4.30 # Propositional solver time : 0.000
% 29.91/4.30 # Success case prop preproc time : 0.000
% 29.91/4.30 # Success case prop encoding time : 0.000
% 29.91/4.30 # Success case prop solver time : 0.000
% 29.91/4.30 # Current number of processed clauses : 1074
% 29.91/4.30 # Positive orientable unit clauses : 151
% 29.91/4.30 # Positive unorientable unit clauses: 0
% 29.91/4.30 # Negative unit clauses : 4
% 29.91/4.30 # Non-unit-clauses : 919
% 29.91/4.30 # Current number of unprocessed clauses: 112370
% 29.91/4.30 # ...number of literals in the above : 490264
% 29.91/4.30 # Current number of archived formulas : 0
% 29.91/4.30 # Current number of archived clauses : 1999
% 29.91/4.30 # Clause-clause subsumption calls (NU) : 565758
% 29.91/4.30 # Rec. Clause-clause subsumption calls : 208162
% 29.91/4.30 # Non-unit clause-clause subsumptions : 1648
% 29.91/4.30 # Unit Clause-clause subsumption calls : 41128
% 29.91/4.30 # Rewrite failures with RHS unbound : 0
% 29.91/4.30 # BW rewrite match attempts : 26136
% 29.91/4.30 # BW rewrite match successes : 244
% 29.91/4.30 # Condensation attempts : 0
% 29.91/4.30 # Condensation successes : 0
% 29.91/4.30 # Termbank termtop insertions : 4601404
% 29.91/4.30
% 29.91/4.30 # -------------------------------------------------
% 29.91/4.30 # User time : 3.558 s
% 29.91/4.30 # System time : 0.115 s
% 29.91/4.30 # Total time : 3.673 s
% 29.91/4.30 # Maximum resident set size: 1636 pages
% 29.91/4.30
% 29.91/4.30 # -------------------------------------------------
% 29.91/4.30 # User time : 17.816 s
% 29.91/4.30 # System time : 0.635 s
% 29.91/4.30 # Total time : 18.451 s
% 29.91/4.30 # Maximum resident set size: 1692 pages
% 29.91/4.30 % E---3.1 exiting
%------------------------------------------------------------------------------