TSTP Solution File: GEO059-2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : GEO059-2 : TPTP v8.2.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n007.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 : 300s
% WCLimit : 300s
% DateTime : Mon May 20 19:57:37 EDT 2024
% Result : Unsatisfiable 0.19s 0.50s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of clauses : 23 ( 17 unt; 0 nHn; 10 RR)
% Number of literals : 32 ( 2 equ; 12 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-4 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-4 aty)
% Number of variables : 60 ( 2 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/benchmark/Axioms/GEO002-0.ax',transitivity_for_equidistance) ).
cnf(reflexivity_for_equidistance,axiom,
equidistant(X1,X2,X2,X1),
file('/export/starexec/sandbox/benchmark/Axioms/GEO002-0.ax',reflexivity_for_equidistance) ).
cnf(segment_construction2,axiom,
equidistant(X1,extension(X2,X1,X3,X4),X3,X4),
file('/export/starexec/sandbox/benchmark/Axioms/GEO002-0.ax',segment_construction2) ).
cnf(reflection,axiom,
reflection(X1,X2) = extension(X1,X2,X1,X2),
file('/export/starexec/sandbox/benchmark/Axioms/GEO002-2.ax',reflection) ).
cnf(prove_congruence,negated_conjecture,
~ equidistant(v,u,v,reflection(reflection(u,v),v)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_congruence) ).
cnf(c_0_5,plain,
( equidistant(X3,X4,X5,X6)
| ~ equidistant(X1,X2,X3,X4)
| ~ equidistant(X1,X2,X5,X6) ),
inference(fof_simplification,[status(thm)],[transitivity_for_equidistance]) ).
cnf(c_0_6,plain,
( equidistant(X3,X4,X5,X6)
| ~ equidistant(X1,X2,X3,X4)
| ~ equidistant(X1,X2,X5,X6) ),
c_0_5 ).
cnf(c_0_7,axiom,
equidistant(X1,X2,X2,X1),
reflexivity_for_equidistance ).
cnf(c_0_8,axiom,
equidistant(X1,extension(X2,X1,X3,X4),X3,X4),
segment_construction2 ).
cnf(c_0_9,axiom,
reflection(X1,X2) = extension(X1,X2,X1,X2),
reflection ).
cnf(c_0_10,plain,
( equidistant(X1,X2,X3,X4)
| ~ equidistant(X4,X3,X1,X2) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_11,plain,
equidistant(X1,reflection(X2,X1),X2,X1),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,plain,
equidistant(X1,X2,reflection(X1,X2),X2),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_13,plain,
equidistant(reflection(X1,X2),X2,X2,X1),
inference(spm,[status(thm)],[c_0_10,c_0_12]) ).
cnf(c_0_14,plain,
equidistant(X1,X2,X1,X2),
inference(spm,[status(thm)],[c_0_10,c_0_7]) ).
cnf(c_0_15,plain,
equidistant(X1,X2,X1,reflection(X2,X1)),
inference(spm,[status(thm)],[c_0_10,c_0_13]) ).
cnf(c_0_16,plain,
( equidistant(X1,X2,X3,X4)
| ~ equidistant(X3,X4,X1,X2) ),
inference(spm,[status(thm)],[c_0_6,c_0_14]) ).
cnf(c_0_17,negated_conjecture,
~ equidistant(v,u,v,reflection(reflection(u,v),v)),
inference(fof_simplification,[status(thm)],[prove_congruence]) ).
cnf(c_0_18,plain,
( equidistant(X1,X2,X3,reflection(X4,X3))
| ~ equidistant(X3,X4,X1,X2) ),
inference(spm,[status(thm)],[c_0_6,c_0_15]) ).
cnf(c_0_19,plain,
equidistant(X1,reflection(X2,X1),X1,X2),
inference(spm,[status(thm)],[c_0_16,c_0_15]) ).
cnf(c_0_20,negated_conjecture,
~ equidistant(v,u,v,reflection(reflection(u,v),v)),
c_0_17 ).
cnf(c_0_21,plain,
equidistant(X1,X2,X1,reflection(reflection(X2,X1),X1)),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_21])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : GEO059-2 : TPTP v8.2.0. Released v1.0.0.
% 0.04/0.14 % Command : run_E %s %d THM
% 0.12/0.35 % Computer : n007.cluster.edu
% 0.12/0.35 % Model : x86_64 x86_64
% 0.12/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.35 % Memory : 8042.1875MB
% 0.12/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.35 % CPULimit : 300
% 0.12/0.35 % WCLimit : 300
% 0.12/0.35 % DateTime : Sun May 19 14:02:52 EDT 2024
% 0.12/0.35 % CPUTime :
% 0.19/0.48 Running first-order theorem proving
% 0.19/0.48 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/benchmark/theBenchmark.p
% 0.19/0.50 # Version: 3.1.0
% 0.19/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.50 # Starting sh5l with 300s (1) cores
% 0.19/0.50 # new_bool_1 with pid 30797 completed with status 0
% 0.19/0.50 # Result found by new_bool_1
% 0.19/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.50 # Search class: FGUSM-FFSF33-SFFFFFNN
% 0.19/0.50 # partial match(1): FGUSM-FFMF33-SFFFFFNN
% 0.19/0.50 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.50 # Starting G-E--_215_C46_F1_AE_CS_SP_PS_S2S with 163s (1) cores
% 0.19/0.50 # G-E--_215_C46_F1_AE_CS_SP_PS_S2S with pid 30801 completed with status 0
% 0.19/0.50 # Result found by G-E--_215_C46_F1_AE_CS_SP_PS_S2S
% 0.19/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.50 # Search class: FGUSM-FFSF33-SFFFFFNN
% 0.19/0.50 # partial match(1): FGUSM-FFMF33-SFFFFFNN
% 0.19/0.50 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.50 # Starting G-E--_215_C46_F1_AE_CS_SP_PS_S2S with 163s (1) cores
% 0.19/0.50 # Preprocessing time : 0.001 s
% 0.19/0.50 # Presaturation interreduction done
% 0.19/0.50
% 0.19/0.50 # Proof found!
% 0.19/0.50 # SZS status Unsatisfiable
% 0.19/0.50 # SZS output start CNFRefutation
% See solution above
% 0.19/0.50 # Parsed axioms : 20
% 0.19/0.50 # Removed by relevancy pruning/SinE : 10
% 0.19/0.50 # Initial clauses : 10
% 0.19/0.50 # Removed in clause preprocessing : 0
% 0.19/0.50 # Initial clauses in saturation : 10
% 0.19/0.50 # Processed clauses : 65
% 0.19/0.50 # ...of these trivial : 2
% 0.19/0.50 # ...subsumed : 6
% 0.19/0.50 # ...remaining for further processing : 57
% 0.19/0.50 # Other redundant clauses eliminated : 0
% 0.19/0.50 # Clauses deleted for lack of memory : 0
% 0.19/0.50 # Backward-subsumed : 0
% 0.19/0.50 # Backward-rewritten : 2
% 0.19/0.50 # Generated clauses : 308
% 0.19/0.50 # ...of the previous two non-redundant : 176
% 0.19/0.50 # ...aggressively subsumed : 0
% 0.19/0.50 # Contextual simplify-reflections : 0
% 0.19/0.50 # Paramodulations : 308
% 0.19/0.50 # Factorizations : 0
% 0.19/0.50 # NegExts : 0
% 0.19/0.50 # Equation resolutions : 0
% 0.19/0.50 # Disequality decompositions : 0
% 0.19/0.50 # Total rewrite steps : 171
% 0.19/0.50 # ...of those cached : 139
% 0.19/0.50 # Propositional unsat checks : 0
% 0.19/0.50 # Propositional check models : 0
% 0.19/0.50 # Propositional check unsatisfiable : 0
% 0.19/0.50 # Propositional clauses : 0
% 0.19/0.50 # Propositional clauses after purity: 0
% 0.19/0.50 # Propositional unsat core size : 0
% 0.19/0.50 # Propositional preprocessing time : 0.000
% 0.19/0.50 # Propositional encoding time : 0.000
% 0.19/0.50 # Propositional solver time : 0.000
% 0.19/0.50 # Success case prop preproc time : 0.000
% 0.19/0.50 # Success case prop encoding time : 0.000
% 0.19/0.50 # Success case prop solver time : 0.000
% 0.19/0.50 # Current number of processed clauses : 45
% 0.19/0.50 # Positive orientable unit clauses : 28
% 0.19/0.50 # Positive unorientable unit clauses: 0
% 0.19/0.50 # Negative unit clauses : 0
% 0.19/0.50 # Non-unit-clauses : 17
% 0.19/0.50 # Current number of unprocessed clauses: 131
% 0.19/0.50 # ...number of literals in the above : 285
% 0.19/0.50 # Current number of archived formulas : 0
% 0.19/0.50 # Current number of archived clauses : 12
% 0.19/0.50 # Clause-clause subsumption calls (NU) : 222
% 0.19/0.50 # Rec. Clause-clause subsumption calls : 142
% 0.19/0.50 # Non-unit clause-clause subsumptions : 6
% 0.19/0.50 # Unit Clause-clause subsumption calls : 6
% 0.19/0.50 # Rewrite failures with RHS unbound : 0
% 0.19/0.50 # BW rewrite match attempts : 279
% 0.19/0.50 # BW rewrite match successes : 2
% 0.19/0.50 # Condensation attempts : 0
% 0.19/0.50 # Condensation successes : 0
% 0.19/0.50 # Termbank termtop insertions : 2916
% 0.19/0.50 # Search garbage collected termcells : 99
% 0.19/0.50
% 0.19/0.50 # -------------------------------------------------
% 0.19/0.50 # User time : 0.005 s
% 0.19/0.50 # System time : 0.003 s
% 0.19/0.50 # Total time : 0.008 s
% 0.19/0.50 # Maximum resident set size: 1780 pages
% 0.19/0.50
% 0.19/0.50 # -------------------------------------------------
% 0.19/0.50 # User time : 0.007 s
% 0.19/0.50 # System time : 0.005 s
% 0.19/0.50 # Total time : 0.012 s
% 0.19/0.50 # Maximum resident set size: 1724 pages
% 0.19/0.50 % E---3.1 exiting
% 0.19/0.50 % E exiting
%------------------------------------------------------------------------------