TSTP Solution File: GEO026-2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : GEO026-2 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n027.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 : 300s
% WCLimit : 300s
% DateTime : Sat May 4 07:41:15 EDT 2024
% Result : Unsatisfiable 0.20s 0.52s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 9
% Syntax : Number of clauses : 33 ( 19 unt; 6 nHn; 28 RR)
% Number of literals : 79 ( 15 equ; 46 neg)
% Maximal clause size : 8 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-4 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 75 ( 0 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.TbEB5AdtdX/E---3.1_8657.p',transitivity_for_equidistance) ).
cnf(reflexivity_for_equidistance,axiom,
equidistant(X1,X2,X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.TbEB5AdtdX/E---3.1_8657.p',reflexivity_for_equidistance) ).
cnf(v_to_w_equals_v_to_x,hypothesis,
equidistant(v,w,v,x),
file('/export/starexec/sandbox2/tmp/tmp.TbEB5AdtdX/E---3.1_8657.p',v_to_w_equals_v_to_x) ).
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.TbEB5AdtdX/E---3.1_8657.p',outer_five_segment) ).
cnf(u_not_v,hypothesis,
u != v,
file('/export/starexec/sandbox2/tmp/tmp.TbEB5AdtdX/E---3.1_8657.p',u_not_v) ).
cnf(identity_for_equidistance,axiom,
( X1 = X2
| ~ equidistant(X1,X2,X3,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.TbEB5AdtdX/E---3.1_8657.p',identity_for_equidistance) ).
cnf(v_between_u_and_x,hypothesis,
between(u,v,x),
file('/export/starexec/sandbox2/tmp/tmp.TbEB5AdtdX/E---3.1_8657.p',v_between_u_and_x) ).
cnf(v_between_u_and_w,hypothesis,
between(u,v,w),
file('/export/starexec/sandbox2/tmp/tmp.TbEB5AdtdX/E---3.1_8657.p',v_between_u_and_w) ).
cnf(prove_w_is_x,negated_conjecture,
w != x,
file('/export/starexec/sandbox2/tmp/tmp.TbEB5AdtdX/E---3.1_8657.p',prove_w_is_x) ).
cnf(c_0_9,plain,
( equidistant(X3,X4,X5,X6)
| ~ equidistant(X1,X2,X3,X4)
| ~ equidistant(X1,X2,X5,X6) ),
inference(fof_simplification,[status(thm)],[transitivity_for_equidistance]) ).
cnf(c_0_10,plain,
( equidistant(X3,X4,X5,X6)
| ~ equidistant(X1,X2,X3,X4)
| ~ equidistant(X1,X2,X5,X6) ),
c_0_9 ).
cnf(c_0_11,axiom,
equidistant(X1,X2,X2,X1),
reflexivity_for_equidistance ).
cnf(c_0_12,hypothesis,
equidistant(v,w,v,x),
v_to_w_equals_v_to_x ).
cnf(c_0_13,plain,
( 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) ),
inference(fof_simplification,[status(thm)],[outer_five_segment]) ).
cnf(c_0_14,plain,
( equidistant(X1,X2,X3,X4)
| ~ equidistant(X4,X3,X1,X2) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,hypothesis,
( equidistant(X1,X2,v,x)
| ~ equidistant(v,w,X1,X2) ),
inference(spm,[status(thm)],[c_0_10,c_0_12]) ).
cnf(c_0_16,plain,
( 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) ),
c_0_13 ).
cnf(c_0_17,plain,
equidistant(X1,X2,X1,X2),
inference(spm,[status(thm)],[c_0_14,c_0_11]) ).
cnf(c_0_18,hypothesis,
equidistant(w,v,v,x),
inference(spm,[status(thm)],[c_0_15,c_0_11]) ).
cnf(c_0_19,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_16,c_0_17]) ).
cnf(c_0_20,hypothesis,
equidistant(v,x,v,w),
inference(spm,[status(thm)],[c_0_14,c_0_18]) ).
cnf(c_0_21,hypothesis,
( X1 = v
| equidistant(x,X2,w,X2)
| ~ between(X3,v,w)
| ~ between(X1,v,x)
| ~ equidistant(X1,v,X3,v)
| ~ equidistant(X1,X2,X3,X2) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_22,hypothesis,
u != v,
inference(fof_simplification,[status(thm)],[u_not_v]) ).
cnf(c_0_23,plain,
( X1 = X2
| ~ equidistant(X1,X2,X3,X3) ),
inference(fof_simplification,[status(thm)],[identity_for_equidistance]) ).
cnf(c_0_24,hypothesis,
( X1 = v
| equidistant(x,X2,w,X2)
| ~ between(X1,v,w)
| ~ between(X1,v,x) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_17]),c_0_17])]) ).
cnf(c_0_25,hypothesis,
between(u,v,x),
v_between_u_and_x ).
cnf(c_0_26,hypothesis,
between(u,v,w),
v_between_u_and_w ).
cnf(c_0_27,hypothesis,
u != v,
c_0_22 ).
cnf(c_0_28,negated_conjecture,
w != x,
inference(fof_simplification,[status(thm)],[prove_w_is_x]) ).
cnf(c_0_29,plain,
( X1 = X2
| ~ equidistant(X1,X2,X3,X3) ),
c_0_23 ).
cnf(c_0_30,hypothesis,
equidistant(x,X1,w,X1),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26])]),c_0_27]) ).
cnf(c_0_31,negated_conjecture,
w != x,
c_0_28 ).
cnf(c_0_32,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.13 % Problem : GEO026-2 : TPTP v8.1.2. Released v1.0.0.
% 0.06/0.14 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n027.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Fri May 3 18:39:23 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.20/0.50 Running first-order theorem proving
% 0.20/0.50 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.TbEB5AdtdX/E---3.1_8657.p
% 0.20/0.52 # Version: 3.1.0
% 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 # new_bool_1 with pid 8737 completed with status 0
% 0.20/0.52 # Result found by new_bool_1
% 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 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.52 # Search class: FGUSF-FFSS00-SFFFFFNN
% 0.20/0.52 # partial match(1): FGUNF-FFSS00-SFFFFFNN
% 0.20/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.52 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.52 # SAT001_MinMin_p005000_rr_RG with pid 8740 completed with status 0
% 0.20/0.52 # Result found by SAT001_MinMin_p005000_rr_RG
% 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 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.52 # Search class: FGUSF-FFSS00-SFFFFFNN
% 0.20/0.52 # partial match(1): FGUNF-FFSS00-SFFFFFNN
% 0.20/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.52 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.52 # Preprocessing time : 0.001 s
% 0.20/0.52 # Presaturation interreduction done
% 0.20/0.52
% 0.20/0.52 # Proof found!
% 0.20/0.52 # SZS status Unsatisfiable
% 0.20/0.52 # SZS output start CNFRefutation
% See solution above
% 0.20/0.52 # Parsed axioms : 23
% 0.20/0.52 # Removed by relevancy pruning/SinE : 12
% 0.20/0.52 # Initial clauses : 11
% 0.20/0.52 # Removed in clause preprocessing : 0
% 0.20/0.52 # Initial clauses in saturation : 11
% 0.20/0.52 # Processed clauses : 74
% 0.20/0.52 # ...of these trivial : 0
% 0.20/0.52 # ...subsumed : 5
% 0.20/0.52 # ...remaining for further processing : 69
% 0.20/0.52 # Other redundant clauses eliminated : 0
% 0.20/0.52 # Clauses deleted for lack of memory : 0
% 0.20/0.52 # Backward-subsumed : 0
% 0.20/0.52 # Backward-rewritten : 4
% 0.20/0.52 # Generated clauses : 136
% 0.20/0.52 # ...of the previous two non-redundant : 63
% 0.20/0.52 # ...aggressively subsumed : 0
% 0.20/0.52 # Contextual simplify-reflections : 0
% 0.20/0.52 # Paramodulations : 136
% 0.20/0.52 # Factorizations : 0
% 0.20/0.52 # NegExts : 0
% 0.20/0.52 # Equation resolutions : 0
% 0.20/0.52 # Disequality decompositions : 0
% 0.20/0.52 # Total rewrite steps : 72
% 0.20/0.52 # ...of those cached : 42
% 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 : 54
% 0.20/0.52 # Positive orientable unit clauses : 13
% 0.20/0.52 # Positive unorientable unit clauses: 0
% 0.20/0.52 # Negative unit clauses : 2
% 0.20/0.52 # Non-unit-clauses : 39
% 0.20/0.52 # Current number of unprocessed clauses: 8
% 0.20/0.52 # ...number of literals in the above : 53
% 0.20/0.52 # Current number of archived formulas : 0
% 0.20/0.52 # Current number of archived clauses : 15
% 0.20/0.52 # Clause-clause subsumption calls (NU) : 1361
% 0.20/0.52 # Rec. Clause-clause subsumption calls : 445
% 0.20/0.52 # Non-unit clause-clause subsumptions : 5
% 0.20/0.52 # Unit Clause-clause subsumption calls : 23
% 0.20/0.52 # Rewrite failures with RHS unbound : 0
% 0.20/0.52 # BW rewrite match attempts : 53
% 0.20/0.52 # BW rewrite match successes : 3
% 0.20/0.52 # Condensation attempts : 0
% 0.20/0.52 # Condensation successes : 0
% 0.20/0.52 # Termbank termtop insertions : 3352
% 0.20/0.52 # Search garbage collected termcells : 107
% 0.20/0.52
% 0.20/0.52 # -------------------------------------------------
% 0.20/0.52 # User time : 0.004 s
% 0.20/0.52 # System time : 0.004 s
% 0.20/0.52 # Total time : 0.008 s
% 0.20/0.52 # Maximum resident set size: 1768 pages
% 0.20/0.52
% 0.20/0.52 # -------------------------------------------------
% 0.20/0.52 # User time : 0.005 s
% 0.20/0.52 # System time : 0.006 s
% 0.20/0.52 # Total time : 0.012 s
% 0.20/0.52 # Maximum resident set size: 1712 pages
% 0.20/0.52 % E---3.1 exiting
% 0.20/0.52 % E exiting
%------------------------------------------------------------------------------