TSTP Solution File: GEO037-2 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : GEO037-2 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n010.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:30 EDT 2023
% Result : Unsatisfiable 0.20s 0.52s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 7
% Syntax : Number of clauses : 27 ( 17 unt; 0 nHn; 15 RR)
% Number of literals : 41 ( 8 equ; 16 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-4 aty)
% Number of functors : 8 ( 8 usr; 7 con; 0-4 aty)
% Number of variables : 71 ( 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/sandbox2/tmp/tmp.OSfUjII19M/E---3.1_2800.p',transitivity_for_equidistance) ).
cnf(segment_construction2,axiom,
equidistant(X1,extension(X2,X1,X3,X4),X3,X4),
file('/export/starexec/sandbox2/tmp/tmp.OSfUjII19M/E---3.1_2800.p',segment_construction2) ).
cnf(reflexivity_for_equidistance,axiom,
equidistant(X1,X2,X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.OSfUjII19M/E---3.1_2800.p',reflexivity_for_equidistance) ).
cnf(prove_lengthen,negated_conjecture,
( v = extension(u,v,lower_dimension_point_1,lower_dimension_point_2)
| ~ equidistant(v,extension(u,v,lower_dimension_point_1,lower_dimension_point_2),x,extension(w,x,lower_dimension_point_1,lower_dimension_point_2))
| ~ between(u,v,extension(u,v,lower_dimension_point_1,lower_dimension_point_2)) ),
file('/export/starexec/sandbox2/tmp/tmp.OSfUjII19M/E---3.1_2800.p',prove_lengthen) ).
cnf(segment_construction1,axiom,
between(X1,X2,extension(X1,X2,X3,X4)),
file('/export/starexec/sandbox2/tmp/tmp.OSfUjII19M/E---3.1_2800.p',segment_construction1) ).
cnf(identity_for_equidistance,axiom,
( X1 = X2
| ~ equidistant(X1,X2,X3,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.OSfUjII19M/E---3.1_2800.p',identity_for_equidistance) ).
cnf(lower_dimension3,axiom,
~ between(lower_dimension_point_3,lower_dimension_point_1,lower_dimension_point_2),
file('/export/starexec/sandbox2/tmp/tmp.OSfUjII19M/E---3.1_2800.p',lower_dimension3) ).
cnf(c_0_7,axiom,
( equidistant(X3,X4,X5,X6)
| ~ equidistant(X1,X2,X3,X4)
| ~ equidistant(X1,X2,X5,X6) ),
transitivity_for_equidistance ).
cnf(c_0_8,axiom,
equidistant(X1,extension(X2,X1,X3,X4),X3,X4),
segment_construction2 ).
cnf(c_0_9,axiom,
equidistant(X1,X2,X2,X1),
reflexivity_for_equidistance ).
cnf(c_0_10,plain,
( equidistant(X1,X2,X3,X4)
| ~ equidistant(X5,extension(X6,X5,X3,X4),X1,X2) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,plain,
( equidistant(X1,X2,X3,X4)
| ~ equidistant(X4,X3,X1,X2) ),
inference(spm,[status(thm)],[c_0_7,c_0_9]) ).
cnf(c_0_12,plain,
equidistant(extension(X1,X2,X3,X4),X2,X3,X4),
inference(spm,[status(thm)],[c_0_10,c_0_9]) ).
cnf(c_0_13,negated_conjecture,
( v = extension(u,v,lower_dimension_point_1,lower_dimension_point_2)
| ~ equidistant(v,extension(u,v,lower_dimension_point_1,lower_dimension_point_2),x,extension(w,x,lower_dimension_point_1,lower_dimension_point_2))
| ~ between(u,v,extension(u,v,lower_dimension_point_1,lower_dimension_point_2)) ),
prove_lengthen ).
cnf(c_0_14,axiom,
between(X1,X2,extension(X1,X2,X3,X4)),
segment_construction1 ).
cnf(c_0_15,plain,
equidistant(X1,X2,X3,extension(X4,X3,X1,X2)),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,negated_conjecture,
( extension(u,v,lower_dimension_point_1,lower_dimension_point_2) = v
| ~ equidistant(v,extension(u,v,lower_dimension_point_1,lower_dimension_point_2),x,extension(w,x,lower_dimension_point_1,lower_dimension_point_2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14])]) ).
cnf(c_0_17,plain,
( equidistant(X1,X2,X3,extension(X4,X3,X5,X6))
| ~ equidistant(X5,X6,X1,X2) ),
inference(spm,[status(thm)],[c_0_7,c_0_15]) ).
cnf(c_0_18,plain,
equidistant(X1,X2,extension(X3,X4,X1,X2),X4),
inference(spm,[status(thm)],[c_0_11,c_0_8]) ).
cnf(c_0_19,negated_conjecture,
extension(u,v,lower_dimension_point_1,lower_dimension_point_2) = v,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_15])]) ).
cnf(c_0_20,axiom,
( X1 = X2
| ~ equidistant(X1,X2,X3,X3) ),
identity_for_equidistance ).
cnf(c_0_21,negated_conjecture,
equidistant(lower_dimension_point_1,lower_dimension_point_2,v,v),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,plain,
extension(X1,X2,X3,X3) = X2,
inference(spm,[status(thm)],[c_0_20,c_0_8]) ).
cnf(c_0_23,axiom,
~ between(lower_dimension_point_3,lower_dimension_point_1,lower_dimension_point_2),
lower_dimension3 ).
cnf(c_0_24,negated_conjecture,
lower_dimension_point_2 = lower_dimension_point_1,
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,plain,
between(X1,X2,X2),
inference(spm,[status(thm)],[c_0_14,c_0_22]) ).
cnf(c_0_26,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24]),c_0_25])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : GEO037-2 : TPTP v8.1.2. Released v1.0.0.
% 0.06/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n010.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 2400
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Tue Oct 3 06:10:35 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.20/0.49 Running first-order model finding
% 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 --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.OSfUjII19M/E---3.1_2800.p
% 0.20/0.52 # Version: 3.1pre001
% 0.20/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.52 # Starting sh5l with 300s (1) cores
% 0.20/0.52 # new_bool_1 with pid 2880 completed with status 0
% 0.20/0.52 # Result found by new_bool_1
% 0.20/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.52 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.52 # Search class: FGUSS-FFSF33-SFFFFFNN
% 0.20/0.52 # partial match(1): FGUSS-FFMF33-SFFFFFNN
% 0.20/0.52 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.52 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with 178s (1) cores
% 0.20/0.52 # G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with pid 2885 completed with status 0
% 0.20/0.52 # Result found by G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I
% 0.20/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.52 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.52 # Search class: FGUSS-FFSF33-SFFFFFNN
% 0.20/0.52 # partial match(1): FGUSS-FFMF33-SFFFFFNN
% 0.20/0.52 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.52 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with 178s (1) cores
% 0.20/0.52 # Preprocessing time : 0.012 s
% 0.20/0.52
% 0.20/0.52 # Proof found!
% 0.20/0.52 # SZS status Unsatisfiable
% 0.20/0.52 # SZS output start CNFRefutation
% See solution above
% 0.20/0.52 # Parsed axioms : 19
% 0.20/0.52 # Removed by relevancy pruning/SinE : 7
% 0.20/0.52 # Initial clauses : 12
% 0.20/0.52 # Removed in clause preprocessing : 0
% 0.20/0.52 # Initial clauses in saturation : 12
% 0.20/0.52 # Processed clauses : 68
% 0.20/0.52 # ...of these trivial : 7
% 0.20/0.52 # ...subsumed : 8
% 0.20/0.52 # ...remaining for further processing : 53
% 0.20/0.52 # Other redundant clauses eliminated : 0
% 0.20/0.52 # Clauses deleted for lack of memory : 0
% 0.20/0.52 # Backward-subsumed : 0
% 0.20/0.52 # Backward-rewritten : 9
% 0.20/0.52 # Generated clauses : 296
% 0.20/0.52 # ...of the previous two non-redundant : 200
% 0.20/0.52 # ...aggressively subsumed : 0
% 0.20/0.52 # Contextual simplify-reflections : 0
% 0.20/0.52 # Paramodulations : 296
% 0.20/0.52 # Factorizations : 0
% 0.20/0.52 # NegExts : 0
% 0.20/0.52 # Equation resolutions : 0
% 0.20/0.52 # Total rewrite steps : 175
% 0.20/0.52 # Propositional unsat checks : 0
% 0.20/0.52 # Propositional check models : 0
% 0.20/0.52 # Propositional check unsatisfiable : 0
% 0.20/0.52 # Propositional clauses : 0
% 0.20/0.52 # Propositional clauses after purity: 0
% 0.20/0.52 # Propositional unsat core size : 0
% 0.20/0.52 # Propositional preprocessing time : 0.000
% 0.20/0.52 # Propositional encoding time : 0.000
% 0.20/0.52 # Propositional solver time : 0.000
% 0.20/0.52 # Success case prop preproc time : 0.000
% 0.20/0.52 # Success case prop encoding time : 0.000
% 0.20/0.52 # Success case prop solver time : 0.000
% 0.20/0.52 # Current number of processed clauses : 44
% 0.20/0.52 # Positive orientable unit clauses : 17
% 0.20/0.52 # Positive unorientable unit clauses: 0
% 0.20/0.52 # Negative unit clauses : 0
% 0.20/0.52 # Non-unit-clauses : 27
% 0.20/0.52 # Current number of unprocessed clauses: 144
% 0.20/0.52 # ...number of literals in the above : 564
% 0.20/0.52 # Current number of archived formulas : 0
% 0.20/0.52 # Current number of archived clauses : 9
% 0.20/0.52 # Clause-clause subsumption calls (NU) : 812
% 0.20/0.52 # Rec. Clause-clause subsumption calls : 323
% 0.20/0.52 # Non-unit clause-clause subsumptions : 8
% 0.20/0.52 # Unit Clause-clause subsumption calls : 45
% 0.20/0.52 # Rewrite failures with RHS unbound : 0
% 0.20/0.52 # BW rewrite match attempts : 213
% 0.20/0.52 # BW rewrite match successes : 3
% 0.20/0.52 # Condensation attempts : 0
% 0.20/0.52 # Condensation successes : 0
% 0.20/0.52 # Termbank termtop insertions : 3780
% 0.20/0.52
% 0.20/0.52 # -------------------------------------------------
% 0.20/0.52 # User time : 0.015 s
% 0.20/0.52 # System time : 0.007 s
% 0.20/0.52 # Total time : 0.022 s
% 0.20/0.52 # Maximum resident set size: 1632 pages
% 0.20/0.52
% 0.20/0.52 # -------------------------------------------------
% 0.20/0.52 # User time : 0.018 s
% 0.20/0.52 # System time : 0.008 s
% 0.20/0.52 # Total time : 0.026 s
% 0.20/0.52 # Maximum resident set size: 1688 pages
% 0.20/0.52 % E---3.1 exiting
%------------------------------------------------------------------------------