TSTP Solution File: GEO028-2 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GEO028-2 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n026.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 : Unsatisfiable 1001.57s 127.57s
% Output : CNFRefutation 1001.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 9
% Syntax : Number of clauses : 38 ( 21 unt; 8 nHn; 22 RR)
% Number of literals : 82 ( 15 equ; 40 neg)
% Maximal clause size : 8 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-4 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-4 aty)
% Number of variables : 129 ( 13 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/sandbox/tmp/tmp.gmH7mw1UFX/E---3.1_17214.p',transitivity_for_equidistance) ).
cnf(w_to_x_equals_y_to_z,hypothesis,
equidistant(w,x,y,z),
file('/export/starexec/sandbox/tmp/tmp.gmH7mw1UFX/E---3.1_17214.p',w_to_x_equals_y_to_z) ).
cnf(reflexivity_for_equidistance,axiom,
equidistant(X1,X2,X2,X1),
file('/export/starexec/sandbox/tmp/tmp.gmH7mw1UFX/E---3.1_17214.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.gmH7mw1UFX/E---3.1_17214.p',outer_five_segment) ).
cnf(segment_construction1,axiom,
between(X1,X2,extension(X1,X2,X3,X4)),
file('/export/starexec/sandbox/tmp/tmp.gmH7mw1UFX/E---3.1_17214.p',segment_construction1) ).
cnf(segment_construction2,axiom,
equidistant(X1,extension(X2,X1,X3,X4),X3,X4),
file('/export/starexec/sandbox/tmp/tmp.gmH7mw1UFX/E---3.1_17214.p',segment_construction2) ).
cnf(identity_for_equidistance,axiom,
( X1 = X2
| ~ equidistant(X1,X2,X3,X3) ),
file('/export/starexec/sandbox/tmp/tmp.gmH7mw1UFX/E---3.1_17214.p',identity_for_equidistance) ).
cnf(prove_equal_extensions,negated_conjecture,
extension(u,v,w,x) != extension(u,v,y,z),
file('/export/starexec/sandbox/tmp/tmp.gmH7mw1UFX/E---3.1_17214.p',prove_equal_extensions) ).
cnf(u_not_v,hypothesis,
u != v,
file('/export/starexec/sandbox/tmp/tmp.gmH7mw1UFX/E---3.1_17214.p',u_not_v) ).
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,hypothesis,
equidistant(w,x,y,z),
w_to_x_equals_y_to_z ).
cnf(c_0_11,axiom,
equidistant(X1,X2,X2,X1),
reflexivity_for_equidistance ).
cnf(c_0_12,hypothesis,
( equidistant(X1,X2,y,z)
| ~ equidistant(w,x,X1,X2) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,plain,
( equidistant(X1,X2,X3,X4)
| ~ equidistant(X4,X3,X1,X2) ),
inference(spm,[status(thm)],[c_0_9,c_0_11]) ).
cnf(c_0_14,hypothesis,
equidistant(x,w,y,z),
inference(spm,[status(thm)],[c_0_12,c_0_11]) ).
cnf(c_0_15,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_16,axiom,
between(X1,X2,extension(X1,X2,X3,X4)),
segment_construction1 ).
cnf(c_0_17,plain,
equidistant(X1,X2,X1,X2),
inference(spm,[status(thm)],[c_0_13,c_0_11]) ).
cnf(c_0_18,hypothesis,
equidistant(y,z,w,x),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,axiom,
equidistant(X1,extension(X2,X1,X3,X4),X3,X4),
segment_construction2 ).
cnf(c_0_20,plain,
( X1 = X2
| equidistant(X3,X4,extension(X5,X6,X7,X8),X9)
| ~ between(X1,X2,X3)
| ~ equidistant(X2,X3,X6,extension(X5,X6,X7,X8))
| ~ equidistant(X2,X4,X6,X9)
| ~ equidistant(X1,X4,X5,X9)
| ~ equidistant(X1,X2,X5,X6) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,plain,
( equidistant(X1,X2,X3,X4)
| ~ equidistant(X3,X4,X1,X2) ),
inference(spm,[status(thm)],[c_0_9,c_0_17]) ).
cnf(c_0_22,hypothesis,
( equidistant(X1,X2,w,x)
| ~ equidistant(y,z,X1,X2) ),
inference(spm,[status(thm)],[c_0_9,c_0_18]) ).
cnf(c_0_23,plain,
equidistant(X1,X2,extension(X3,X4,X1,X2),X4),
inference(spm,[status(thm)],[c_0_13,c_0_19]) ).
cnf(c_0_24,plain,
( X1 = X2
| equidistant(extension(X1,X2,X3,X4),X5,extension(X6,X7,X8,X9),X10)
| ~ equidistant(X2,extension(X1,X2,X3,X4),X7,extension(X6,X7,X8,X9))
| ~ equidistant(X2,X5,X7,X10)
| ~ equidistant(X1,X5,X6,X10)
| ~ equidistant(X1,X2,X6,X7) ),
inference(spm,[status(thm)],[c_0_20,c_0_16]) ).
cnf(c_0_25,plain,
equidistant(X1,X2,X3,extension(X4,X3,X1,X2)),
inference(spm,[status(thm)],[c_0_21,c_0_19]) ).
cnf(c_0_26,hypothesis,
equidistant(extension(X1,X2,y,z),X2,w,x),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_27,plain,
( X1 = X2
| equidistant(extension(X1,X2,X3,X4),X5,extension(X6,X2,X7,X8),X5)
| ~ equidistant(X2,extension(X1,X2,X3,X4),X2,extension(X6,X2,X7,X8))
| ~ equidistant(X1,X5,X6,X5)
| ~ equidistant(X1,X2,X6,X2) ),
inference(spm,[status(thm)],[c_0_24,c_0_17]) ).
cnf(c_0_28,plain,
( equidistant(X1,X2,X3,extension(X4,X3,X5,X6))
| ~ equidistant(X5,X6,X1,X2) ),
inference(spm,[status(thm)],[c_0_9,c_0_25]) ).
cnf(c_0_29,hypothesis,
equidistant(w,x,X1,extension(X2,X1,y,z)),
inference(spm,[status(thm)],[c_0_13,c_0_26]) ).
cnf(c_0_30,plain,
( X1 = X2
| equidistant(extension(X1,X2,X3,X4),X5,extension(X1,X2,X6,X7),X5)
| ~ equidistant(X2,extension(X1,X2,X3,X4),X2,extension(X1,X2,X6,X7)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_17]),c_0_17])]) ).
cnf(c_0_31,hypothesis,
equidistant(X1,extension(X2,X1,y,z),X3,extension(X4,X3,w,x)),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_32,axiom,
( X1 = X2
| ~ equidistant(X1,X2,X3,X3) ),
identity_for_equidistance ).
cnf(c_0_33,hypothesis,
( X1 = X2
| equidistant(extension(X1,X2,y,z),X3,extension(X1,X2,w,x),X3) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_34,negated_conjecture,
extension(u,v,w,x) != extension(u,v,y,z),
prove_equal_extensions ).
cnf(c_0_35,hypothesis,
( extension(X1,X2,y,z) = extension(X1,X2,w,x)
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_36,hypothesis,
u != v,
u_not_v ).
cnf(c_0_37,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.08 % Problem : GEO028-2 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.09 % Command : run_E %s %d THM
% 0.08/0.28 % Computer : n026.cluster.edu
% 0.08/0.28 % Model : x86_64 x86_64
% 0.08/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.28 % Memory : 8042.1875MB
% 0.08/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.28 % CPULimit : 2400
% 0.08/0.28 % WCLimit : 300
% 0.08/0.28 % DateTime : Tue Oct 3 07:14:44 EDT 2023
% 0.08/0.29 % CPUTime :
% 0.13/0.38 Running first-order theorem proving
% 0.13/0.38 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.gmH7mw1UFX/E---3.1_17214.p
% 1001.57/127.57 # Version: 3.1pre001
% 1001.57/127.57 # Preprocessing class: FSMSSMSMSSSNFFN.
% 1001.57/127.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1001.57/127.57 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 1001.57/127.57 # Starting new_bool_3 with 300s (1) cores
% 1001.57/127.57 # Starting new_bool_1 with 300s (1) cores
% 1001.57/127.57 # Starting sh5l with 300s (1) cores
% 1001.57/127.57 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 17292 completed with status 0
% 1001.57/127.57 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 1001.57/127.57 # Preprocessing class: FSMSSMSMSSSNFFN.
% 1001.57/127.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1001.57/127.57 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 1001.57/127.57 # No SInE strategy applied
% 1001.57/127.57 # Search class: FGUSS-FFMF33-SFFFFFNN
% 1001.57/127.57 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1001.57/127.57 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with 888s (1) cores
% 1001.57/127.57 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 1001.57/127.57 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 136s (1) cores
% 1001.57/127.57 # Starting 208_C09_12_F1_SE_CS_SP_PS_S070I with 136s (1) cores
% 1001.57/127.57 # Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 1001.57/127.57 # G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with pid 17300 completed with status 0
% 1001.57/127.57 # Result found by G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c
% 1001.57/127.57 # Preprocessing class: FSMSSMSMSSSNFFN.
% 1001.57/127.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1001.57/127.57 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 1001.57/127.57 # No SInE strategy applied
% 1001.57/127.57 # Search class: FGUSS-FFMF33-SFFFFFNN
% 1001.57/127.57 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1001.57/127.57 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with 888s (1) cores
% 1001.57/127.57 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 1001.57/127.57 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 136s (1) cores
% 1001.57/127.57 # Preprocessing time : 0.001 s
% 1001.57/127.57 # Presaturation interreduction done
% 1001.57/127.57
% 1001.57/127.57 # Proof found!
% 1001.57/127.57 # SZS status Unsatisfiable
% 1001.57/127.57 # SZS output start CNFRefutation
% See solution above
% 1001.57/127.57 # Parsed axioms : 21
% 1001.57/127.57 # Removed by relevancy pruning/SinE : 0
% 1001.57/127.57 # Initial clauses : 21
% 1001.57/127.57 # Removed in clause preprocessing : 0
% 1001.57/127.57 # Initial clauses in saturation : 21
% 1001.57/127.57 # Processed clauses : 54194
% 1001.57/127.57 # ...of these trivial : 21268
% 1001.57/127.57 # ...subsumed : 10476
% 1001.57/127.57 # ...remaining for further processing : 22450
% 1001.57/127.57 # Other redundant clauses eliminated : 0
% 1001.57/127.57 # Clauses deleted for lack of memory : 101496
% 1001.57/127.57 # Backward-subsumed : 266
% 1001.57/127.57 # Backward-rewritten : 518
% 1001.57/127.57 # Generated clauses : 5601854
% 1001.57/127.57 # ...of the previous two non-redundant : 5403803
% 1001.57/127.57 # ...aggressively subsumed : 0
% 1001.57/127.57 # Contextual simplify-reflections : 0
% 1001.57/127.57 # Paramodulations : 5601854
% 1001.57/127.57 # Factorizations : 0
% 1001.57/127.57 # NegExts : 0
% 1001.57/127.57 # Equation resolutions : 0
% 1001.57/127.57 # Total rewrite steps : 602229
% 1001.57/127.57 # Propositional unsat checks : 0
% 1001.57/127.57 # Propositional check models : 0
% 1001.57/127.57 # Propositional check unsatisfiable : 0
% 1001.57/127.57 # Propositional clauses : 0
% 1001.57/127.57 # Propositional clauses after purity: 0
% 1001.57/127.57 # Propositional unsat core size : 0
% 1001.57/127.57 # Propositional preprocessing time : 0.000
% 1001.57/127.57 # Propositional encoding time : 0.000
% 1001.57/127.57 # Propositional solver time : 0.000
% 1001.57/127.57 # Success case prop preproc time : 0.000
% 1001.57/127.57 # Success case prop encoding time : 0.000
% 1001.57/127.57 # Success case prop solver time : 0.000
% 1001.57/127.57 # Current number of processed clauses : 21645
% 1001.57/127.57 # Positive orientable unit clauses : 11770
% 1001.57/127.57 # Positive unorientable unit clauses: 0
% 1001.57/127.57 # Negative unit clauses : 5
% 1001.57/127.57 # Non-unit-clauses : 9870
% 1001.57/127.57 # Current number of unprocessed clauses: 1968615
% 1001.57/127.57 # ...number of literals in the above : 3216291
% 1001.57/127.57 # Current number of archived formulas : 0
% 1001.57/127.57 # Current number of archived clauses : 805
% 1001.57/127.57 # Clause-clause subsumption calls (NU) : 12159090
% 1001.57/127.57 # Rec. Clause-clause subsumption calls : 7351168
% 1001.57/127.57 # Non-unit clause-clause subsumptions : 10742
% 1001.57/127.57 # Unit Clause-clause subsumption calls : 4023841
% 1001.57/127.57 # Rewrite failures with RHS unbound : 0
% 1001.57/127.57 # BW rewrite match attempts : 4673155
% 1001.57/127.57 # BW rewrite match successes : 402
% 1001.57/127.57 # Condensation attempts : 0
% 1001.57/127.57 # Condensation successes : 0
% 1001.57/127.57 # Termbank termtop insertions : 274303443
% 1001.57/127.57
% 1001.57/127.57 # -------------------------------------------------
% 1001.57/127.57 # User time : 123.292 s
% 1001.57/127.57 # System time : 1.675 s
% 1001.57/127.57 # Total time : 124.967 s
% 1001.57/127.57 # Maximum resident set size: 1640 pages
% 1001.57/127.57
% 1001.57/127.57 # -------------------------------------------------
% 1001.57/127.57 # User time : 616.208 s
% 1001.57/127.57 # System time : 8.788 s
% 1001.57/127.57 # Total time : 624.996 s
% 1001.57/127.57 # Maximum resident set size: 1692 pages
% 1001.57/127.57 % E---3.1 exiting
% 1001.57/127.58 % E---3.1 exiting
%------------------------------------------------------------------------------