TSTP Solution File: GEO033-3 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : GEO033-3 : TPTP v8.1.2. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n018.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:29 EDT 2023
% Result : Unsatisfiable 8.11s 1.52s
% Output : CNFRefutation 8.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 13
% Syntax : Number of clauses : 39 ( 21 unt; 0 nHn; 37 RR)
% Number of literals : 84 ( 0 equ; 47 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-4 aty)
% Number of functors : 8 ( 8 usr; 8 con; 0-0 aty)
% Number of variables : 67 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(d4_5,axiom,
( equidistant(X4,X3,X2,X1)
| ~ equidistant(X1,X2,X3,X4) ),
file('/export/starexec/sandbox2/tmp/tmp.ygTCLrA84a/E---3.1_8288.p',d4_5) ).
cnf(u_to_v_equals_u1_to_v1,hypothesis,
equidistant(u,v,u1,v1),
file('/export/starexec/sandbox2/tmp/tmp.ygTCLrA84a/E---3.1_8288.p',u_to_v_equals_u1_to_v1) ).
cnf(b9,axiom,
( between(X1,X2,X4)
| ~ between(X1,X2,X3)
| ~ between(X1,X3,X4) ),
file('/export/starexec/sandbox2/tmp/tmp.ygTCLrA84a/E---3.1_8288.p',b9) ).
cnf(v_between_u_and_w,hypothesis,
between(u,v,w),
file('/export/starexec/sandbox2/tmp/tmp.ygTCLrA84a/E---3.1_8288.p',v_between_u_and_w) ).
cnf(d8,axiom,
( equidistant(X1,X5,X3,X6)
| ~ equidistant(X1,X2,X3,X4)
| ~ equidistant(X2,X5,X4,X6)
| ~ between(X1,X2,X5)
| ~ between(X3,X4,X6) ),
file('/export/starexec/sandbox2/tmp/tmp.ygTCLrA84a/E---3.1_8288.p',d8) ).
cnf(t1,axiom,
( between(X3,X2,X1)
| ~ between(X1,X2,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.ygTCLrA84a/E---3.1_8288.p',t1) ).
cnf(v1_between_u1_and_w1,hypothesis,
between(u1,v1,w1),
file('/export/starexec/sandbox2/tmp/tmp.ygTCLrA84a/E---3.1_8288.p',v1_between_u1_and_w1) ).
cnf(t3,axiom,
between(X1,X2,X2),
file('/export/starexec/sandbox2/tmp/tmp.ygTCLrA84a/E---3.1_8288.p',t3) ).
cnf(v_to_w_equals_v1_to_w1,hypothesis,
equidistant(v,w,v1,w1),
file('/export/starexec/sandbox2/tmp/tmp.ygTCLrA84a/E---3.1_8288.p',v_to_w_equals_v1_to_w1) ).
cnf(d12,axiom,
( equidistant(X2,X7,X4,X8)
| ~ equidistant(X1,X2,X3,X4)
| ~ equidistant(X1,X5,X3,X6)
| ~ equidistant(X1,X7,X3,X8)
| ~ equidistant(X5,X7,X6,X8)
| ~ between(X1,X2,X5)
| ~ between(X3,X4,X6) ),
file('/export/starexec/sandbox2/tmp/tmp.ygTCLrA84a/E---3.1_8288.p',d12) ).
cnf(w_to_x_equals_w1_to_x1,hypothesis,
equidistant(w,x,w1,x1),
file('/export/starexec/sandbox2/tmp/tmp.ygTCLrA84a/E---3.1_8288.p',w_to_x_equals_w1_to_x1) ).
cnf(u_to_x_equals_u1_to_x1,hypothesis,
equidistant(u,x,u1,x1),
file('/export/starexec/sandbox2/tmp/tmp.ygTCLrA84a/E---3.1_8288.p',u_to_x_equals_u1_to_x1) ).
cnf(prove_v_to_x_equals_v1_to_x1,negated_conjecture,
~ equidistant(v,x,v1,x1),
file('/export/starexec/sandbox2/tmp/tmp.ygTCLrA84a/E---3.1_8288.p',prove_v_to_x_equals_v1_to_x1) ).
cnf(c_0_13,axiom,
( equidistant(X4,X3,X2,X1)
| ~ equidistant(X1,X2,X3,X4) ),
d4_5 ).
cnf(c_0_14,hypothesis,
equidistant(u,v,u1,v1),
u_to_v_equals_u1_to_v1 ).
cnf(c_0_15,axiom,
( between(X1,X2,X4)
| ~ between(X1,X2,X3)
| ~ between(X1,X3,X4) ),
b9 ).
cnf(c_0_16,hypothesis,
between(u,v,w),
v_between_u_and_w ).
cnf(c_0_17,axiom,
( equidistant(X1,X5,X3,X6)
| ~ equidistant(X1,X2,X3,X4)
| ~ equidistant(X2,X5,X4,X6)
| ~ between(X1,X2,X5)
| ~ between(X3,X4,X6) ),
d8 ).
cnf(c_0_18,hypothesis,
equidistant(v1,u1,v,u),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,axiom,
( between(X3,X2,X1)
| ~ between(X1,X2,X3) ),
t1 ).
cnf(c_0_20,hypothesis,
( between(u,X1,w)
| ~ between(u,X1,v) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,hypothesis,
between(u1,v1,w1),
v1_between_u1_and_w1 ).
cnf(c_0_22,hypothesis,
( equidistant(X1,u1,X2,u)
| ~ between(X2,v,u)
| ~ between(X1,v1,u1)
| ~ equidistant(X1,v1,X2,v) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_23,hypothesis,
( between(w,X1,u)
| ~ between(u,X1,v) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,axiom,
between(X1,X2,X2),
t3 ).
cnf(c_0_25,hypothesis,
( between(u1,X1,w1)
| ~ between(u1,X1,v1) ),
inference(spm,[status(thm)],[c_0_15,c_0_21]) ).
cnf(c_0_26,hypothesis,
equidistant(v,w,v1,w1),
v_to_w_equals_v1_to_w1 ).
cnf(c_0_27,hypothesis,
( equidistant(X1,u1,w,u)
| ~ between(X1,v1,u1)
| ~ equidistant(X1,v1,w,v) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24])]) ).
cnf(c_0_28,hypothesis,
( between(w1,X1,u1)
| ~ between(u1,X1,v1) ),
inference(spm,[status(thm)],[c_0_19,c_0_25]) ).
cnf(c_0_29,hypothesis,
equidistant(w1,v1,w,v),
inference(spm,[status(thm)],[c_0_13,c_0_26]) ).
cnf(c_0_30,axiom,
( equidistant(X2,X7,X4,X8)
| ~ equidistant(X1,X2,X3,X4)
| ~ equidistant(X1,X5,X3,X6)
| ~ equidistant(X1,X7,X3,X8)
| ~ equidistant(X5,X7,X6,X8)
| ~ between(X1,X2,X5)
| ~ between(X3,X4,X6) ),
d12 ).
cnf(c_0_31,hypothesis,
equidistant(w,x,w1,x1),
w_to_x_equals_w1_to_x1 ).
cnf(c_0_32,hypothesis,
equidistant(w1,u1,w,u),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]),c_0_24])]) ).
cnf(c_0_33,hypothesis,
( equidistant(X1,x,X2,x1)
| ~ between(X3,X2,w1)
| ~ between(X4,X1,w)
| ~ equidistant(X4,x,X3,x1)
| ~ equidistant(X4,w,X3,w1)
| ~ equidistant(X4,X1,X3,X2) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_34,hypothesis,
equidistant(u,x,u1,x1),
u_to_x_equals_u1_to_x1 ).
cnf(c_0_35,hypothesis,
equidistant(u,w,u1,w1),
inference(spm,[status(thm)],[c_0_13,c_0_32]) ).
cnf(c_0_36,hypothesis,
( equidistant(X1,x,X2,x1)
| ~ between(u1,X2,w1)
| ~ between(u,X1,w)
| ~ equidistant(u,X1,u1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35])]) ).
cnf(c_0_37,negated_conjecture,
~ equidistant(v,x,v1,x1),
prove_v_to_x_equals_v1_to_x1 ).
cnf(c_0_38,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_14]),c_0_21]),c_0_16])]),c_0_37]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : GEO033-3 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.13/0.14 % Command : run_E %s %d THM
% 0.15/0.36 % Computer : n018.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 2400
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Tue Oct 3 07:14:24 EDT 2023
% 0.15/0.36 % CPUTime :
% 0.22/0.50 Running first-order model finding
% 0.22/0.50 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.ygTCLrA84a/E---3.1_8288.p
% 8.11/1.52 # Version: 3.1pre001
% 8.11/1.52 # Preprocessing class: FSLSSMSMSSSNFFN.
% 8.11/1.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.11/1.52 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 8.11/1.52 # Starting new_bool_3 with 300s (1) cores
% 8.11/1.52 # Starting new_bool_1 with 300s (1) cores
% 8.11/1.52 # Starting sh5l with 300s (1) cores
% 8.11/1.52 # new_bool_3 with pid 8479 completed with status 0
% 8.11/1.52 # Result found by new_bool_3
% 8.11/1.52 # Preprocessing class: FSLSSMSMSSSNFFN.
% 8.11/1.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.11/1.52 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 8.11/1.52 # Starting new_bool_3 with 300s (1) cores
% 8.11/1.52 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 8.11/1.52 # Search class: FGUSM-FFMM00-SFFFFFNN
% 8.11/1.52 # partial match(2): FGUSM-FFMM33-SFFFFFNN
% 8.11/1.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 8.11/1.52 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 69s (1) cores
% 8.11/1.52 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with pid 8489 completed with status 0
% 8.11/1.52 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y
% 8.11/1.52 # Preprocessing class: FSLSSMSMSSSNFFN.
% 8.11/1.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.11/1.52 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 8.11/1.52 # Starting new_bool_3 with 300s (1) cores
% 8.11/1.52 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 8.11/1.52 # Search class: FGUSM-FFMM00-SFFFFFNN
% 8.11/1.52 # partial match(2): FGUSM-FFMM33-SFFFFFNN
% 8.11/1.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 8.11/1.52 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 69s (1) cores
% 8.11/1.52 # Preprocessing time : 0.002 s
% 8.11/1.52 # Presaturation interreduction done
% 8.11/1.52
% 8.11/1.52 # Proof found!
% 8.11/1.52 # SZS status Unsatisfiable
% 8.11/1.52 # SZS output start CNFRefutation
% See solution above
% 8.11/1.52 # Parsed axioms : 74
% 8.11/1.52 # Removed by relevancy pruning/SinE : 32
% 8.11/1.52 # Initial clauses : 42
% 8.11/1.52 # Removed in clause preprocessing : 1
% 8.11/1.52 # Initial clauses in saturation : 41
% 8.11/1.52 # Processed clauses : 13668
% 8.11/1.52 # ...of these trivial : 119
% 8.11/1.52 # ...subsumed : 9596
% 8.11/1.52 # ...remaining for further processing : 3953
% 8.11/1.52 # Other redundant clauses eliminated : 1
% 8.11/1.52 # Clauses deleted for lack of memory : 0
% 8.11/1.52 # Backward-subsumed : 184
% 8.11/1.52 # Backward-rewritten : 2
% 8.11/1.52 # Generated clauses : 52830
% 8.11/1.52 # ...of the previous two non-redundant : 47207
% 8.11/1.52 # ...aggressively subsumed : 0
% 8.11/1.52 # Contextual simplify-reflections : 2
% 8.11/1.52 # Paramodulations : 52829
% 8.11/1.52 # Factorizations : 0
% 8.11/1.52 # NegExts : 0
% 8.11/1.52 # Equation resolutions : 1
% 8.11/1.52 # Total rewrite steps : 10654
% 8.11/1.52 # Propositional unsat checks : 0
% 8.11/1.52 # Propositional check models : 0
% 8.11/1.52 # Propositional check unsatisfiable : 0
% 8.11/1.52 # Propositional clauses : 0
% 8.11/1.52 # Propositional clauses after purity: 0
% 8.11/1.52 # Propositional unsat core size : 0
% 8.11/1.52 # Propositional preprocessing time : 0.000
% 8.11/1.52 # Propositional encoding time : 0.000
% 8.11/1.52 # Propositional solver time : 0.000
% 8.11/1.52 # Success case prop preproc time : 0.000
% 8.11/1.52 # Success case prop encoding time : 0.000
% 8.11/1.52 # Success case prop solver time : 0.000
% 8.11/1.52 # Current number of processed clauses : 3727
% 8.11/1.52 # Positive orientable unit clauses : 49
% 8.11/1.52 # Positive unorientable unit clauses: 0
% 8.11/1.52 # Negative unit clauses : 7
% 8.11/1.52 # Non-unit-clauses : 3671
% 8.11/1.52 # Current number of unprocessed clauses: 33015
% 8.11/1.52 # ...number of literals in the above : 140761
% 8.11/1.52 # Current number of archived formulas : 0
% 8.11/1.52 # Current number of archived clauses : 225
% 8.11/1.52 # Clause-clause subsumption calls (NU) : 1307927
% 8.11/1.52 # Rec. Clause-clause subsumption calls : 828437
% 8.11/1.52 # Non-unit clause-clause subsumptions : 9619
% 8.11/1.52 # Unit Clause-clause subsumption calls : 471
% 8.11/1.52 # Rewrite failures with RHS unbound : 0
% 8.11/1.52 # BW rewrite match attempts : 79
% 8.11/1.52 # BW rewrite match successes : 2
% 8.11/1.52 # Condensation attempts : 0
% 8.11/1.52 # Condensation successes : 0
% 8.11/1.52 # Termbank termtop insertions : 836869
% 8.11/1.52
% 8.11/1.52 # -------------------------------------------------
% 8.11/1.52 # User time : 0.967 s
% 8.11/1.52 # System time : 0.020 s
% 8.11/1.52 # Total time : 0.987 s
% 8.11/1.52 # Maximum resident set size: 1832 pages
% 8.11/1.52
% 8.11/1.52 # -------------------------------------------------
% 8.11/1.52 # User time : 0.968 s
% 8.11/1.52 # System time : 0.023 s
% 8.11/1.52 # Total time : 0.991 s
% 8.11/1.52 # Maximum resident set size: 1732 pages
% 8.11/1.52 % E---3.1 exiting
%------------------------------------------------------------------------------