TSTP Solution File: GEO030-2 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GEO030-2 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n015.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:31:10 EDT 2023
% Result : Timeout 326.70s 300.16s
% Output : None
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 9
% Syntax : Number of clauses : 30 ( 18 unt; 3 nHn; 27 RR)
% Number of literals : 63 ( 10 equ; 34 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 : 56 ( 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.RDGphzDOmj/E---3.1_25243.p',transitivity_for_equidistance) ).
cnf(reflexivity_for_equidistance,axiom,
equidistant(X1,X2,X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.RDGphzDOmj/E---3.1_25243.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/sandbox2/tmp/tmp.RDGphzDOmj/E---3.1_25243.p',outer_five_segment) ).
cnf(v_between_u_and_w,hypothesis,
between(u,v,w),
file('/export/starexec/sandbox2/tmp/tmp.RDGphzDOmj/E---3.1_25243.p',v_between_u_and_w) ).
cnf(v_to_w_equals_v_to_w1,hypothesis,
equidistant(v,w,v,w1),
file('/export/starexec/sandbox2/tmp/tmp.RDGphzDOmj/E---3.1_25243.p',v_to_w_equals_v_to_w1) ).
cnf(u_to_w_equals_u_to_w1,hypothesis,
equidistant(u,w,u,w1),
file('/export/starexec/sandbox2/tmp/tmp.RDGphzDOmj/E---3.1_25243.p',u_to_w_equals_u_to_w1) ).
cnf(u_not_v,hypothesis,
u != v,
file('/export/starexec/sandbox2/tmp/tmp.RDGphzDOmj/E---3.1_25243.p',u_not_v) ).
cnf(identity_for_equidistance,axiom,
( X1 = X2
| ~ equidistant(X1,X2,X3,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.RDGphzDOmj/E---3.1_25243.p',identity_for_equidistance) ).
cnf(prove_w_is_w1,negated_conjecture,
w != w1,
file('/export/starexec/sandbox2/tmp/tmp.RDGphzDOmj/E---3.1_25243.p',prove_w_is_w1) ).
cnf(c_0_9,axiom,
( equidistant(X3,X4,X5,X6)
| ~ equidistant(X1,X2,X3,X4)
| ~ equidistant(X1,X2,X5,X6) ),
transitivity_for_equidistance ).
cnf(c_0_10,axiom,
equidistant(X1,X2,X2,X1),
reflexivity_for_equidistance ).
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,
between(u,v,w),
v_between_u_and_w ).
cnf(c_0_13,plain,
( equidistant(X1,X2,X3,X4)
| ~ equidistant(X4,X3,X1,X2) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,hypothesis,
equidistant(v,w,v,w1),
v_to_w_equals_v_to_w1 ).
cnf(c_0_15,hypothesis,
equidistant(u,w,u,w1),
u_to_w_equals_u_to_w1 ).
cnf(c_0_16,hypothesis,
( X1 = X2
| equidistant(X3,X4,w,X5)
| ~ between(X1,X2,X3)
| ~ equidistant(X2,X3,v,w)
| ~ equidistant(X1,X2,u,v)
| ~ equidistant(X2,X4,v,X5)
| ~ equidistant(X1,X4,u,X5) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_17,plain,
equidistant(X1,X2,X1,X2),
inference(spm,[status(thm)],[c_0_13,c_0_10]) ).
cnf(c_0_18,hypothesis,
u != v,
u_not_v ).
cnf(c_0_19,hypothesis,
( equidistant(X1,X2,v,w1)
| ~ equidistant(v,w,X1,X2) ),
inference(spm,[status(thm)],[c_0_9,c_0_14]) ).
cnf(c_0_20,hypothesis,
( equidistant(X1,X2,u,w1)
| ~ equidistant(u,w,X1,X2) ),
inference(spm,[status(thm)],[c_0_9,c_0_15]) ).
cnf(c_0_21,axiom,
( X1 = X2
| ~ equidistant(X1,X2,X3,X3) ),
identity_for_equidistance ).
cnf(c_0_22,hypothesis,
( equidistant(w,X1,w,X2)
| ~ equidistant(v,X1,v,X2)
| ~ equidistant(u,X1,u,X2) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_12]),c_0_17]),c_0_17])]),c_0_18]) ).
cnf(c_0_23,hypothesis,
equidistant(w,v,v,w1),
inference(spm,[status(thm)],[c_0_19,c_0_10]) ).
cnf(c_0_24,hypothesis,
equidistant(w,u,u,w1),
inference(spm,[status(thm)],[c_0_20,c_0_10]) ).
cnf(c_0_25,hypothesis,
( w = X1
| ~ equidistant(v,X1,v,w)
| ~ equidistant(u,X1,u,w) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,hypothesis,
equidistant(v,w1,v,w),
inference(spm,[status(thm)],[c_0_13,c_0_23]) ).
cnf(c_0_27,hypothesis,
equidistant(u,w1,u,w),
inference(spm,[status(thm)],[c_0_13,c_0_24]) ).
cnf(c_0_28,negated_conjecture,
w != w1,
prove_w_is_w1 ).
cnf(c_0_29,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27])]),c_0_28]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.13 % Problem : GEO030-2 : TPTP v8.1.2. Released v1.0.0.
% 0.06/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n015.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 2400
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Tue Oct 3 06:28:31 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.49 Running first-order theorem proving
% 0.20/0.49 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.RDGphzDOmj/E---3.1_25243.p
% 326.70/300.16 # Version: 3.1pre001
% 326.70/300.16 # Preprocessing class: FSMSSMSSSSSNFFN.
% 326.70/300.16 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 326.70/300.16 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 326.70/300.16 # Starting new_bool_3 with 300s (1) cores
% 326.70/300.16 # Starting new_bool_1 with 300s (1) cores
% 326.70/300.16 # Starting sh5l with 300s (1) cores
% 326.70/300.16 # sh5l with pid 25330 completed with status 0
% 326.70/300.16 # Result found by sh5l
% 326.70/300.16 # Preprocessing class: FSMSSMSSSSSNFFN.
% 326.70/300.16 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 326.70/300.16 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 326.70/300.16 # Starting new_bool_3 with 300s (1) cores
% 326.70/300.16 # Starting new_bool_1 with 300s (1) cores
% 326.70/300.16 # Starting sh5l with 300s (1) cores
% 326.70/300.16 # SinE strategy is gf500_gu_R04_F100_L20000
% 326.70/300.16 # Search class: FGUSS-FFMS33-SFFFFFNN
% 326.70/300.16 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 326.70/300.16 # Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI with 135s (1) cores
% 326.70/300.16 # G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI with pid 25334 completed with status 0
% 326.70/300.16 # Result found by G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI
% 326.70/300.16 # Preprocessing class: FSMSSMSSSSSNFFN.
% 326.70/300.16 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 326.70/300.16 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 326.70/300.16 # Starting new_bool_3 with 300s (1) cores
% 326.70/300.16 # Starting new_bool_1 with 300s (1) cores
% 326.70/300.16 # Starting sh5l with 300s (1) cores
% 326.70/300.16 # SinE strategy is gf500_gu_R04_F100_L20000
% 326.70/300.16 # Search class: FGUSS-FFMS33-SFFFFFNN
% 326.70/300.16 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 326.70/300.16 # Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI with 135s (1) cores
% 326.70/300.16 # Preprocessing time : 0.001 s
% 326.70/300.16 # Presaturation interreduction done
% 326.70/300.16
% 326.70/300.16 # Proof found!
% 326.70/300.16 # SZS status Unsatisfiable
% 326.70/300.16 # SZS output start CNFRefutation
% See solution above
% 326.70/300.16 # Parsed axioms : 23
% 326.70/300.16 # Removed by relevancy pruning/SinE : 5
% 326.70/300.16 # Initial clauses : 18
% 326.70/300.16 # Removed in clause preprocessing : 0
% 326.70/300.16 # Initial clauses in saturation : 18
% 326.70/300.16 # Processed clauses : 110
% 326.70/300.16 # ...of these trivial : 1
% 326.70/300.16 # ...subsumed : 1
% 326.70/300.16 # ...remaining for further processing : 108
% 326.70/300.16 # Other redundant clauses eliminated : 0
% 326.70/300.16 # Clauses deleted for lack of memory : 0
% 326.70/300.16 # Backward-subsumed : 0
% 326.70/300.16 # Backward-rewritten : 5
% 326.70/300.16 # Generated clauses : 296
% 326.70/300.16 # ...of the previous two non-redundant : 179
% 326.70/300.16 # ...aggressively subsumed : 0
% 326.70/300.16 # Contextual simplify-reflections : 0
% 326.70/300.16 # Paramodulations : 296
% 326.70/300.16 # Factorizations : 0
% 326.70/300.16 # NegExts : 0
% 326.70/300.16 # Equation resolutions : 0
% 326.70/300.16 # Total rewrite steps : 143
% 326.70/300.16 # Propositional unsat checks : 0
% 326.70/300.16 # Propositional check models : 0
% 326.70/300.16 # Propositional check unsatisfiable : 0
% 326.70/300.16 # Propositional clauses : 0
% 326.70/300.16 # Propositional clauses after purity: 0
% 326.70/300.16 # Propositional unsat core size : 0
% 326.70/300.16 # Propositional preprocessing time : 0.000
% 326.70/300.16 # Propositional encoding time : 0.000
% 326.70/300.16 # Propositional solver time : 0.000
% 326.70/300.16 # Success case prop preproc time : 0.000
% 326.70/300.16 # Success case prop encoding time : 0.000
% 326.70/300.16 # Success case prop solver time : 0.000
% 326.70/300.16 # Current number of processed clauses : 85
% 326.70/300.16 # Positive orientable unit clauses : 37
% 326.70/300.16 # Positive unorientable unit clauses: 0
% 326.70/300.16 # Negative unit clauses : 5
% 326.70/300.16 # Non-unit-clauses : 43
% 326.70/300.16 # Current number of unprocessed clauses: 98
% 326.70/300.16 # ...number of literals in the above : 262
% 326.70/300.16 # Current number of archived formulas : 0
% 326.70/300.16 # Current number of archived clauses : 23
% 326.70/300.16 # Clause-clause subsumption calls (NU) : 671
% 326.70/300.16 # Rec. Clause-clause subsumption calls : 327
% 326.70/300.16 # Non-unit clause-clause subsumptions : 1
% 326.70/300.16 # Unit Clause-clause subsumption calls : 25
% 326.70/300.16 # Rewrite failures with RHS unbound : 0
% 326.70/300.16 # BW rewrite match attempts : 294
% 326.70/300.16 # BW rewrite match successes : 5
% 326.70/300.16 # Condensation attempts : 0
% 326.70/300.16 # Condensation successes : 0
% 326.70/300.16 # Termbank termtop insertions : 4269
% 326.70/300.16
% 326.70/300.16 # -------------------------------------------------
% 326.70/300.16 # User time : 0.008 s
% 326.70/300.16 # System time : 0.003 s
% 326.70/300.16 # Total time : 0.010 s
% 326.70/300.16 # Maximum resident set size: 1624 pages
% 326.70/300.16
% 326.70/300.16 # -------------------------------------------------
% 326.70/300.16 # User time : 0.011 s
% 326.70/300.16 # System time : 0.003 s
% 326.70/300.16 # Total time : 0.014 s
% 326.70/300.16 # Maximum resident set size: 1692 pages
% 326.70/300.16 % E---3.1 exiting
% 326.70/300.16 % E---3.1 exiting
%------------------------------------------------------------------------------