TSTP Solution File: GEO030-3 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : GEO030-3 : 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:33:29 EDT 2023
% Result : Unsatisfiable 5.98s 1.36s
% Output : CNFRefutation 5.98s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 9
% Syntax : Number of clauses : 24 ( 15 unt; 4 nHn; 22 RR)
% Number of literals : 54 ( 10 equ; 30 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 : 42 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(d2,axiom,
( equidistant(X3,X4,X1,X2)
| ~ equidistant(X1,X2,X3,X4) ),
file('/export/starexec/sandbox/tmp/tmp.OYZuuFiV2U/E---3.1_5113.p',d2) ).
cnf(v_to_w_equals_v_to_w1,hypothesis,
equidistant(v,w,v,w1),
file('/export/starexec/sandbox/tmp/tmp.OYZuuFiV2U/E---3.1_5113.p',v_to_w_equals_v_to_w1) ).
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.OYZuuFiV2U/E---3.1_5113.p',outer_five_segment) ).
cnf(d1,axiom,
equidistant(X1,X2,X1,X2),
file('/export/starexec/sandbox/tmp/tmp.OYZuuFiV2U/E---3.1_5113.p',d1) ).
cnf(u_to_w_equals_u_to_w1,hypothesis,
equidistant(u,w,u,w1),
file('/export/starexec/sandbox/tmp/tmp.OYZuuFiV2U/E---3.1_5113.p',u_to_w_equals_u_to_w1) ).
cnf(u_not_v,hypothesis,
u != v,
file('/export/starexec/sandbox/tmp/tmp.OYZuuFiV2U/E---3.1_5113.p',u_not_v) ).
cnf(identity_for_equidistance,axiom,
( X1 = X2
| ~ equidistant(X1,X2,X3,X3) ),
file('/export/starexec/sandbox/tmp/tmp.OYZuuFiV2U/E---3.1_5113.p',identity_for_equidistance) ).
cnf(v_between_u_and_w,hypothesis,
between(u,v,w),
file('/export/starexec/sandbox/tmp/tmp.OYZuuFiV2U/E---3.1_5113.p',v_between_u_and_w) ).
cnf(prove_w_is_w1,negated_conjecture,
w != w1,
file('/export/starexec/sandbox/tmp/tmp.OYZuuFiV2U/E---3.1_5113.p',prove_w_is_w1) ).
cnf(c_0_9,axiom,
( equidistant(X3,X4,X1,X2)
| ~ equidistant(X1,X2,X3,X4) ),
d2 ).
cnf(c_0_10,hypothesis,
equidistant(v,w,v,w1),
v_to_w_equals_v_to_w1 ).
cnf(c_0_11,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_12,hypothesis,
equidistant(v,w1,v,w),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,hypothesis,
( X1 = v
| equidistant(X2,w1,X3,w)
| ~ between(X4,v,X3)
| ~ between(X1,v,X2)
| ~ equidistant(v,X2,v,X3)
| ~ equidistant(X1,w1,X4,w)
| ~ equidistant(X1,v,X4,v) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_14,axiom,
equidistant(X1,X2,X1,X2),
d1 ).
cnf(c_0_15,hypothesis,
equidistant(u,w,u,w1),
u_to_w_equals_u_to_w1 ).
cnf(c_0_16,hypothesis,
( X1 = v
| equidistant(X2,w1,X2,w)
| ~ between(X3,v,X2)
| ~ between(X1,v,X2)
| ~ equidistant(X1,w1,X3,w)
| ~ equidistant(X1,v,X3,v) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,hypothesis,
equidistant(u,w1,u,w),
inference(spm,[status(thm)],[c_0_9,c_0_15]) ).
cnf(c_0_18,hypothesis,
u != v,
u_not_v ).
cnf(c_0_19,axiom,
( X1 = X2
| ~ equidistant(X1,X2,X3,X3) ),
identity_for_equidistance ).
cnf(c_0_20,hypothesis,
( equidistant(X1,w1,X1,w)
| ~ between(u,v,X1) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_14])]),c_0_18]) ).
cnf(c_0_21,hypothesis,
between(u,v,w),
v_between_u_and_w ).
cnf(c_0_22,negated_conjecture,
w != w1,
prove_w_is_w1 ).
cnf(c_0_23,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]),c_0_22]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.14 % Problem : GEO030-3 : TPTP v8.1.2. Released v1.0.0.
% 0.07/0.15 % Command : run_E %s %d THM
% 0.16/0.37 % Computer : n020.cluster.edu
% 0.16/0.37 % Model : x86_64 x86_64
% 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37 % Memory : 8042.1875MB
% 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37 % CPULimit : 2400
% 0.16/0.37 % WCLimit : 300
% 0.16/0.37 % DateTime : Tue Oct 3 06:43:46 EDT 2023
% 0.16/0.37 % CPUTime :
% 0.23/0.52 Running first-order model finding
% 0.23/0.52 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.OYZuuFiV2U/E---3.1_5113.p
% 5.98/1.36 # Version: 3.1pre001
% 5.98/1.36 # Preprocessing class: FSLSSMSSSSSNFFN.
% 5.98/1.36 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.98/1.36 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 5.98/1.36 # Starting new_bool_3 with 300s (1) cores
% 5.98/1.36 # Starting new_bool_1 with 300s (1) cores
% 5.98/1.36 # Starting sh5l with 300s (1) cores
% 5.98/1.36 # new_bool_3 with pid 5218 completed with status 0
% 5.98/1.36 # Result found by new_bool_3
% 5.98/1.36 # Preprocessing class: FSLSSMSSSSSNFFN.
% 5.98/1.36 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.98/1.36 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 5.98/1.36 # Starting new_bool_3 with 300s (1) cores
% 5.98/1.36 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 5.98/1.36 # Search class: FGUSM-FFMS00-SFFFFFNN
% 5.98/1.36 # partial match(2): FGUSM-FFMS33-SFFFFFNN
% 5.98/1.36 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 5.98/1.36 # Starting G-E--_208_C02AMC_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 5.98/1.36 # G-E--_208_C02AMC_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 5221 completed with status 0
% 5.98/1.36 # Result found by G-E--_208_C02AMC_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 5.98/1.36 # Preprocessing class: FSLSSMSSSSSNFFN.
% 5.98/1.36 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.98/1.36 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 5.98/1.36 # Starting new_bool_3 with 300s (1) cores
% 5.98/1.36 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 5.98/1.36 # Search class: FGUSM-FFMS00-SFFFFFNN
% 5.98/1.36 # partial match(2): FGUSM-FFMS33-SFFFFFNN
% 5.98/1.36 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 5.98/1.36 # Starting G-E--_208_C02AMC_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 5.98/1.36 # Preprocessing time : 0.001 s
% 5.98/1.36 # Presaturation interreduction done
% 5.98/1.36
% 5.98/1.36 # Proof found!
% 5.98/1.36 # SZS status Unsatisfiable
% 5.98/1.36 # SZS output start CNFRefutation
% See solution above
% 5.98/1.36 # Parsed axioms : 69
% 5.98/1.36 # Removed by relevancy pruning/SinE : 32
% 5.98/1.36 # Initial clauses : 37
% 5.98/1.36 # Removed in clause preprocessing : 1
% 5.98/1.36 # Initial clauses in saturation : 36
% 5.98/1.36 # Processed clauses : 7564
% 5.98/1.36 # ...of these trivial : 42
% 5.98/1.36 # ...subsumed : 5775
% 5.98/1.36 # ...remaining for further processing : 1747
% 5.98/1.36 # Other redundant clauses eliminated : 1
% 5.98/1.36 # Clauses deleted for lack of memory : 0
% 5.98/1.36 # Backward-subsumed : 251
% 5.98/1.36 # Backward-rewritten : 0
% 5.98/1.36 # Generated clauses : 20560
% 5.98/1.36 # ...of the previous two non-redundant : 17202
% 5.98/1.36 # ...aggressively subsumed : 0
% 5.98/1.36 # Contextual simplify-reflections : 16
% 5.98/1.36 # Paramodulations : 20559
% 5.98/1.36 # Factorizations : 0
% 5.98/1.36 # NegExts : 0
% 5.98/1.36 # Equation resolutions : 1
% 5.98/1.36 # Total rewrite steps : 8709
% 5.98/1.36 # Propositional unsat checks : 0
% 5.98/1.36 # Propositional check models : 0
% 5.98/1.36 # Propositional check unsatisfiable : 0
% 5.98/1.36 # Propositional clauses : 0
% 5.98/1.36 # Propositional clauses after purity: 0
% 5.98/1.36 # Propositional unsat core size : 0
% 5.98/1.36 # Propositional preprocessing time : 0.000
% 5.98/1.36 # Propositional encoding time : 0.000
% 5.98/1.36 # Propositional solver time : 0.000
% 5.98/1.36 # Success case prop preproc time : 0.000
% 5.98/1.36 # Success case prop encoding time : 0.000
% 5.98/1.36 # Success case prop solver time : 0.000
% 5.98/1.36 # Current number of processed clauses : 1461
% 5.98/1.36 # Positive orientable unit clauses : 23
% 5.98/1.36 # Positive unorientable unit clauses: 0
% 5.98/1.36 # Negative unit clauses : 12
% 5.98/1.36 # Non-unit-clauses : 1426
% 5.98/1.36 # Current number of unprocessed clauses: 9578
% 5.98/1.36 # ...number of literals in the above : 53023
% 5.98/1.36 # Current number of archived formulas : 0
% 5.98/1.36 # Current number of archived clauses : 285
% 5.98/1.36 # Clause-clause subsumption calls (NU) : 1010196
% 5.98/1.36 # Rec. Clause-clause subsumption calls : 457850
% 5.98/1.36 # Non-unit clause-clause subsumptions : 5353
% 5.98/1.36 # Unit Clause-clause subsumption calls : 2382
% 5.98/1.36 # Rewrite failures with RHS unbound : 0
% 5.98/1.36 # BW rewrite match attempts : 40
% 5.98/1.36 # BW rewrite match successes : 0
% 5.98/1.36 # Condensation attempts : 0
% 5.98/1.36 # Condensation successes : 0
% 5.98/1.36 # Termbank termtop insertions : 340115
% 5.98/1.36
% 5.98/1.36 # -------------------------------------------------
% 5.98/1.36 # User time : 0.774 s
% 5.98/1.36 # System time : 0.008 s
% 5.98/1.36 # Total time : 0.782 s
% 5.98/1.36 # Maximum resident set size: 1808 pages
% 5.98/1.36
% 5.98/1.36 # -------------------------------------------------
% 5.98/1.36 # User time : 0.778 s
% 5.98/1.36 # System time : 0.009 s
% 5.98/1.36 # Total time : 0.787 s
% 5.98/1.36 # Maximum resident set size: 1728 pages
% 5.98/1.36 % E---3.1 exiting
%------------------------------------------------------------------------------