TSTP Solution File: GEO029-3 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : GEO029-3 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n017.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:28 EDT 2023
% Result : Unsatisfiable 0.20s 0.51s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of clauses : 24 ( 11 unt; 6 nHn; 16 RR)
% Number of literals : 51 ( 16 equ; 25 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-4 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-4 aty)
% Number of variables : 86 ( 9 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(d4_4,axiom,
( equidistant(X4,X3,X1,X2)
| ~ equidistant(X1,X2,X3,X4) ),
file('/export/starexec/sandbox/tmp/tmp.b62hY1mj07/E---3.1_13736.p',d4_4) ).
cnf(segment_construction2,axiom,
equidistant(X1,extension(X2,X1,X3,X4),X3,X4),
file('/export/starexec/sandbox/tmp/tmp.b62hY1mj07/E---3.1_13736.p',segment_construction2) ).
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.b62hY1mj07/E---3.1_13736.p',transitivity_for_equidistance) ).
cnf(d9,axiom,
( X1 = X2
| X3 = X4
| ~ between(X1,X2,X3)
| ~ between(X1,X2,X4)
| ~ equidistant(X2,X3,X2,X4) ),
file('/export/starexec/sandbox/tmp/tmp.b62hY1mj07/E---3.1_13736.p',d9) ).
cnf(segment_construction1,axiom,
between(X1,X2,extension(X1,X2,X3,X4)),
file('/export/starexec/sandbox/tmp/tmp.b62hY1mj07/E---3.1_13736.p',segment_construction1) ).
cnf(d2,axiom,
( equidistant(X3,X4,X1,X2)
| ~ equidistant(X1,X2,X3,X4) ),
file('/export/starexec/sandbox/tmp/tmp.b62hY1mj07/E---3.1_13736.p',d2) ).
cnf(prove_equal_extensions,negated_conjecture,
extension(u,v,u,v) != extension(u,v,v,u),
file('/export/starexec/sandbox/tmp/tmp.b62hY1mj07/E---3.1_13736.p',prove_equal_extensions) ).
cnf(u_not_v,hypothesis,
u != v,
file('/export/starexec/sandbox/tmp/tmp.b62hY1mj07/E---3.1_13736.p',u_not_v) ).
cnf(c_0_8,axiom,
( equidistant(X4,X3,X1,X2)
| ~ equidistant(X1,X2,X3,X4) ),
d4_4 ).
cnf(c_0_9,axiom,
equidistant(X1,extension(X2,X1,X3,X4),X3,X4),
segment_construction2 ).
cnf(c_0_10,axiom,
( equidistant(X3,X4,X5,X6)
| ~ equidistant(X1,X2,X3,X4)
| ~ equidistant(X1,X2,X5,X6) ),
transitivity_for_equidistance ).
cnf(c_0_11,plain,
equidistant(X1,X2,X3,extension(X4,X3,X2,X1)),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,axiom,
( X1 = X2
| X3 = X4
| ~ between(X1,X2,X3)
| ~ between(X1,X2,X4)
| ~ equidistant(X2,X3,X2,X4) ),
d9 ).
cnf(c_0_13,plain,
( equidistant(X1,X2,X3,extension(X4,X3,X5,X6))
| ~ equidistant(X6,X5,X1,X2) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,plain,
( X1 = extension(X2,X3,X4,X5)
| X6 = X3
| ~ between(X6,X3,extension(X2,X3,X4,X5))
| ~ between(X6,X3,X1)
| ~ equidistant(X5,X4,X3,X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_15,axiom,
between(X1,X2,extension(X1,X2,X3,X4)),
segment_construction1 ).
cnf(c_0_16,axiom,
( equidistant(X3,X4,X1,X2)
| ~ equidistant(X1,X2,X3,X4) ),
d2 ).
cnf(c_0_17,plain,
( X1 = extension(X2,X3,X4,X5)
| X2 = X3
| ~ between(X2,X3,X1)
| ~ equidistant(X5,X4,X3,X1) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,plain,
equidistant(X1,X2,X3,extension(X4,X3,X1,X2)),
inference(spm,[status(thm)],[c_0_16,c_0_9]) ).
cnf(c_0_19,plain,
( extension(X1,X2,X3,X4) = extension(X5,X2,X4,X3)
| X5 = X2
| ~ between(X5,X2,extension(X1,X2,X3,X4)) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_20,negated_conjecture,
extension(u,v,u,v) != extension(u,v,v,u),
prove_equal_extensions ).
cnf(c_0_21,plain,
( extension(X1,X2,X3,X4) = extension(X1,X2,X4,X3)
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_19,c_0_15]) ).
cnf(c_0_22,hypothesis,
u != v,
u_not_v ).
cnf(c_0_23,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GEO029-3 : TPTP v8.1.2. Released v1.0.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n017.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 2400
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue Oct 3 06:17:56 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.20/0.46 Running first-order model finding
% 0.20/0.46 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.b62hY1mj07/E---3.1_13736.p
% 0.20/0.51 # Version: 3.1pre001
% 0.20/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.51 # Starting sh5l with 300s (1) cores
% 0.20/0.51 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 13840 completed with status 0
% 0.20/0.51 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.20/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.51 # No SInE strategy applied
% 0.20/0.51 # Search class: FGUSM-FFMF33-SFFFFFNN
% 0.20/0.51 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.51 # Starting G-E--_215_C46_F1_AE_CS_SP_PS_S2S with 811s (1) cores
% 0.20/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.20/0.51 # Starting new_bool_3 with 136s (1) cores
% 0.20/0.51 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with 136s (1) cores
% 0.20/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 136s (1) cores
% 0.20/0.51 # G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with pid 13851 completed with status 0
% 0.20/0.51 # Result found by G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I
% 0.20/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.51 # No SInE strategy applied
% 0.20/0.51 # Search class: FGUSM-FFMF33-SFFFFFNN
% 0.20/0.51 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.51 # Starting G-E--_215_C46_F1_AE_CS_SP_PS_S2S with 811s (1) cores
% 0.20/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.20/0.51 # Starting new_bool_3 with 136s (1) cores
% 0.20/0.51 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with 136s (1) cores
% 0.20/0.51 # Preprocessing time : 0.002 s
% 0.20/0.51
% 0.20/0.51 # Proof found!
% 0.20/0.51 # SZS status Unsatisfiable
% 0.20/0.51 # SZS output start CNFRefutation
% See solution above
% 0.20/0.51 # Parsed axioms : 40
% 0.20/0.51 # Removed by relevancy pruning/SinE : 0
% 0.20/0.51 # Initial clauses : 40
% 0.20/0.51 # Removed in clause preprocessing : 1
% 0.20/0.51 # Initial clauses in saturation : 39
% 0.20/0.51 # Processed clauses : 297
% 0.20/0.51 # ...of these trivial : 30
% 0.20/0.51 # ...subsumed : 93
% 0.20/0.51 # ...remaining for further processing : 174
% 0.20/0.51 # Other redundant clauses eliminated : 9
% 0.20/0.51 # Clauses deleted for lack of memory : 0
% 0.20/0.51 # Backward-subsumed : 1
% 0.20/0.51 # Backward-rewritten : 0
% 0.20/0.51 # Generated clauses : 1734
% 0.20/0.51 # ...of the previous two non-redundant : 1245
% 0.20/0.51 # ...aggressively subsumed : 0
% 0.20/0.51 # Contextual simplify-reflections : 0
% 0.20/0.51 # Paramodulations : 1714
% 0.20/0.51 # Factorizations : 0
% 0.20/0.51 # NegExts : 0
% 0.20/0.51 # Equation resolutions : 20
% 0.20/0.51 # Total rewrite steps : 563
% 0.20/0.51 # Propositional unsat checks : 0
% 0.20/0.51 # Propositional check models : 0
% 0.20/0.51 # Propositional check unsatisfiable : 0
% 0.20/0.51 # Propositional clauses : 0
% 0.20/0.51 # Propositional clauses after purity: 0
% 0.20/0.51 # Propositional unsat core size : 0
% 0.20/0.51 # Propositional preprocessing time : 0.000
% 0.20/0.51 # Propositional encoding time : 0.000
% 0.20/0.51 # Propositional solver time : 0.000
% 0.20/0.51 # Success case prop preproc time : 0.000
% 0.20/0.51 # Success case prop encoding time : 0.000
% 0.20/0.51 # Success case prop solver time : 0.000
% 0.20/0.51 # Current number of processed clauses : 172
% 0.20/0.51 # Positive orientable unit clauses : 30
% 0.20/0.51 # Positive unorientable unit clauses: 0
% 0.20/0.51 # Negative unit clauses : 11
% 0.20/0.51 # Non-unit-clauses : 131
% 0.20/0.51 # Current number of unprocessed clauses: 985
% 0.20/0.51 # ...number of literals in the above : 3856
% 0.20/0.51 # Current number of archived formulas : 0
% 0.20/0.51 # Current number of archived clauses : 2
% 0.20/0.51 # Clause-clause subsumption calls (NU) : 7231
% 0.20/0.51 # Rec. Clause-clause subsumption calls : 3611
% 0.20/0.51 # Non-unit clause-clause subsumptions : 88
% 0.20/0.51 # Unit Clause-clause subsumption calls : 514
% 0.20/0.51 # Rewrite failures with RHS unbound : 0
% 0.20/0.51 # BW rewrite match attempts : 888
% 0.20/0.51 # BW rewrite match successes : 0
% 0.20/0.51 # Condensation attempts : 0
% 0.20/0.51 # Condensation successes : 0
% 0.20/0.51 # Termbank termtop insertions : 17412
% 0.20/0.51
% 0.20/0.51 # -------------------------------------------------
% 0.20/0.51 # User time : 0.035 s
% 0.20/0.51 # System time : 0.006 s
% 0.20/0.51 # Total time : 0.041 s
% 0.20/0.51 # Maximum resident set size: 1712 pages
% 0.20/0.51
% 0.20/0.51 # -------------------------------------------------
% 0.20/0.51 # User time : 0.177 s
% 0.20/0.51 # System time : 0.025 s
% 0.20/0.51 # Total time : 0.202 s
% 0.20/0.51 # Maximum resident set size: 1704 pages
% 0.20/0.51 % E---3.1 exiting
%------------------------------------------------------------------------------