TSTP Solution File: GEO125-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : GEO125-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n014.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 20:00:42 EDT 2024
% Result : Unsatisfiable 0.12s 0.35s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of clauses : 32 ( 14 unt; 5 nHn; 32 RR)
% Number of literals : 61 ( 11 equ; 33 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-4 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-4 aty)
% Number of variables : 62 ( 10 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(between_c_defn_1,axiom,
( ~ between_c(X1,X2,X3,X4)
| X2 != X4 ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO004-1.ax',between_c_defn_1) ).
cnf(o3_24,axiom,
( between_c(ax2_sk4(X1,X4,X3,X2),X2,X3,X4)
| ~ between_o(X1,X2,X3,X4) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO004-2.ax',o3_24) ).
cnf(finish_point_defn_13,axiom,
( X1 = X3
| ordered_by(X2,X3,X1)
| ~ finish_point(X1,X2)
| ~ incident_o(X3,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO004-2.ax',finish_point_defn_13) ).
cnf(finish_point_defn_12,axiom,
( incident_o(X1,X2)
| ~ finish_point(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO004-2.ax',finish_point_defn_12) ).
cnf(between_o_defn_6,axiom,
( between_o(X1,X4,X3,X2)
| ~ ordered_by(X1,X2,X3)
| ~ ordered_by(X1,X3,X4) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO004-2.ax',between_o_defn_6) ).
cnf(corollary_4_10_2_133,negated_conjecture,
finish_point(sk26,sk25),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',corollary_4_10_2_133) ).
cnf(corollary_4_10_2_134,negated_conjecture,
finish_point(sk27,sk25),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',corollary_4_10_2_134) ).
cnf(corollary_4_10_2_135,negated_conjecture,
sk26 != sk27,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',corollary_4_10_2_135) ).
cnf(c_0_8,plain,
( ~ between_c(X1,X2,X3,X4)
| X2 != X4 ),
inference(fof_simplification,[status(thm)],[between_c_defn_1]) ).
cnf(c_0_9,plain,
( ~ between_c(X1,X2,X3,X4)
| X2 != X4 ),
c_0_8 ).
cnf(c_0_10,plain,
( between_c(ax2_sk4(X1,X4,X3,X2),X2,X3,X4)
| ~ between_o(X1,X2,X3,X4) ),
inference(fof_simplification,[status(thm)],[o3_24]) ).
cnf(c_0_11,plain,
( X1 = X3
| ordered_by(X2,X3,X1)
| ~ finish_point(X1,X2)
| ~ incident_o(X3,X2) ),
inference(fof_simplification,[status(thm)],[finish_point_defn_13]) ).
cnf(c_0_12,plain,
( incident_o(X1,X2)
| ~ finish_point(X1,X2) ),
inference(fof_simplification,[status(thm)],[finish_point_defn_12]) ).
cnf(c_0_13,plain,
~ between_c(X1,X2,X3,X2),
inference(er,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
( between_c(ax2_sk4(X1,X4,X3,X2),X2,X3,X4)
| ~ between_o(X1,X2,X3,X4) ),
c_0_10 ).
cnf(c_0_15,plain,
( between_o(X1,X4,X3,X2)
| ~ ordered_by(X1,X2,X3)
| ~ ordered_by(X1,X3,X4) ),
inference(fof_simplification,[status(thm)],[between_o_defn_6]) ).
cnf(c_0_16,plain,
( X1 = X3
| ordered_by(X2,X3,X1)
| ~ finish_point(X1,X2)
| ~ incident_o(X3,X2) ),
c_0_11 ).
cnf(c_0_17,negated_conjecture,
finish_point(sk26,sk25),
corollary_4_10_2_133 ).
cnf(c_0_18,plain,
( incident_o(X1,X2)
| ~ finish_point(X1,X2) ),
c_0_12 ).
cnf(c_0_19,negated_conjecture,
finish_point(sk27,sk25),
corollary_4_10_2_134 ).
cnf(c_0_20,negated_conjecture,
sk26 != sk27,
inference(fof_simplification,[status(thm)],[corollary_4_10_2_135]) ).
cnf(c_0_21,plain,
~ between_o(X1,X2,X3,X2),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_22,plain,
( between_o(X1,X4,X3,X2)
| ~ ordered_by(X1,X2,X3)
| ~ ordered_by(X1,X3,X4) ),
c_0_15 ).
cnf(c_0_23,negated_conjecture,
( sk26 = X1
| ordered_by(sk25,X1,sk26)
| ~ incident_o(X1,sk25) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_24,negated_conjecture,
incident_o(sk27,sk25),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_25,negated_conjecture,
sk26 != sk27,
c_0_20 ).
cnf(c_0_26,negated_conjecture,
( sk27 = X1
| ordered_by(sk25,X1,sk27)
| ~ incident_o(X1,sk25) ),
inference(spm,[status(thm)],[c_0_16,c_0_19]) ).
cnf(c_0_27,negated_conjecture,
incident_o(sk26,sk25),
inference(spm,[status(thm)],[c_0_18,c_0_17]) ).
cnf(c_0_28,plain,
( ~ ordered_by(X1,X2,X3)
| ~ ordered_by(X1,X3,X2) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_29,negated_conjecture,
ordered_by(sk25,sk27,sk26),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]) ).
cnf(c_0_30,negated_conjecture,
ordered_by(sk25,sk26,sk27),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_25]) ).
cnf(c_0_31,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.01/0.07 % Problem : GEO125-1 : TPTP v8.2.0. Released v2.4.0.
% 0.01/0.08 % Command : run_E %s %d THM
% 0.08/0.26 % Computer : n014.cluster.edu
% 0.08/0.26 % Model : x86_64 x86_64
% 0.08/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.26 % Memory : 8042.1875MB
% 0.08/0.26 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.26 % CPULimit : 300
% 0.08/0.26 % WCLimit : 300
% 0.08/0.26 % DateTime : Sun May 19 13:51:37 EDT 2024
% 0.12/0.26 % CPUTime :
% 0.12/0.33 Running first-order model finding
% 0.12/0.33 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/benchmark/theBenchmark.p
% 0.12/0.35 # Version: 3.1.0
% 0.12/0.35 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.12/0.35 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.35 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.12/0.35 # Starting new_bool_3 with 300s (1) cores
% 0.12/0.35 # Starting new_bool_1 with 300s (1) cores
% 0.12/0.35 # Starting sh5l with 300s (1) cores
% 0.12/0.35 # sh5l with pid 980 completed with status 0
% 0.12/0.35 # Result found by sh5l
% 0.12/0.35 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.12/0.35 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.35 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.12/0.35 # Starting new_bool_3 with 300s (1) cores
% 0.12/0.35 # Starting new_bool_1 with 300s (1) cores
% 0.12/0.35 # Starting sh5l with 300s (1) cores
% 0.12/0.35 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.12/0.35 # Search class: FGHSF-FFMF32-SFFFFFNN
% 0.12/0.35 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.12/0.35 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 163s (1) cores
% 0.12/0.35 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 987 completed with status 0
% 0.12/0.35 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.12/0.35 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.12/0.35 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.35 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.12/0.35 # Starting new_bool_3 with 300s (1) cores
% 0.12/0.35 # Starting new_bool_1 with 300s (1) cores
% 0.12/0.35 # Starting sh5l with 300s (1) cores
% 0.12/0.35 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.12/0.35 # Search class: FGHSF-FFMF32-SFFFFFNN
% 0.12/0.35 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.12/0.35 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 163s (1) cores
% 0.12/0.35 # Preprocessing time : 0.001 s
% 0.12/0.35 # Presaturation interreduction done
% 0.12/0.35
% 0.12/0.35 # Proof found!
% 0.12/0.35 # SZS status Unsatisfiable
% 0.12/0.35 # SZS output start CNFRefutation
% See solution above
% 0.12/0.35 # Parsed axioms : 99
% 0.12/0.35 # Removed by relevancy pruning/SinE : 24
% 0.12/0.35 # Initial clauses : 75
% 0.12/0.35 # Removed in clause preprocessing : 9
% 0.12/0.35 # Initial clauses in saturation : 66
% 0.12/0.35 # Processed clauses : 157
% 0.12/0.35 # ...of these trivial : 0
% 0.12/0.35 # ...subsumed : 4
% 0.12/0.35 # ...remaining for further processing : 153
% 0.12/0.35 # Other redundant clauses eliminated : 7
% 0.12/0.35 # Clauses deleted for lack of memory : 0
% 0.12/0.35 # Backward-subsumed : 0
% 0.12/0.35 # Backward-rewritten : 0
% 0.12/0.35 # Generated clauses : 128
% 0.12/0.35 # ...of the previous two non-redundant : 97
% 0.12/0.35 # ...aggressively subsumed : 0
% 0.12/0.35 # Contextual simplify-reflections : 2
% 0.12/0.35 # Paramodulations : 121
% 0.12/0.35 # Factorizations : 0
% 0.12/0.35 # NegExts : 0
% 0.12/0.35 # Equation resolutions : 7
% 0.12/0.35 # Disequality decompositions : 0
% 0.12/0.35 # Total rewrite steps : 11
% 0.12/0.35 # ...of those cached : 6
% 0.12/0.35 # Propositional unsat checks : 0
% 0.12/0.35 # Propositional check models : 0
% 0.12/0.35 # Propositional check unsatisfiable : 0
% 0.12/0.35 # Propositional clauses : 0
% 0.12/0.35 # Propositional clauses after purity: 0
% 0.12/0.35 # Propositional unsat core size : 0
% 0.12/0.35 # Propositional preprocessing time : 0.000
% 0.12/0.35 # Propositional encoding time : 0.000
% 0.12/0.35 # Propositional solver time : 0.000
% 0.12/0.35 # Success case prop preproc time : 0.000
% 0.12/0.35 # Success case prop encoding time : 0.000
% 0.12/0.35 # Success case prop solver time : 0.000
% 0.12/0.35 # Current number of processed clauses : 80
% 0.12/0.35 # Positive orientable unit clauses : 6
% 0.12/0.35 # Positive unorientable unit clauses: 0
% 0.12/0.35 # Negative unit clauses : 3
% 0.12/0.35 # Non-unit-clauses : 71
% 0.12/0.35 # Current number of unprocessed clauses: 72
% 0.12/0.35 # ...number of literals in the above : 268
% 0.12/0.35 # Current number of archived formulas : 0
% 0.12/0.35 # Current number of archived clauses : 66
% 0.12/0.35 # Clause-clause subsumption calls (NU) : 2356
% 0.12/0.35 # Rec. Clause-clause subsumption calls : 1587
% 0.12/0.35 # Non-unit clause-clause subsumptions : 6
% 0.12/0.35 # Unit Clause-clause subsumption calls : 64
% 0.12/0.35 # Rewrite failures with RHS unbound : 0
% 0.12/0.35 # BW rewrite match attempts : 0
% 0.12/0.35 # BW rewrite match successes : 0
% 0.12/0.35 # Condensation attempts : 0
% 0.12/0.35 # Condensation successes : 0
% 0.12/0.35 # Termbank termtop insertions : 4596
% 0.12/0.35 # Search garbage collected termcells : 297
% 0.12/0.35
% 0.12/0.35 # -------------------------------------------------
% 0.12/0.35 # User time : 0.007 s
% 0.12/0.35 # System time : 0.001 s
% 0.12/0.35 # Total time : 0.009 s
% 0.12/0.35 # Maximum resident set size: 1868 pages
% 0.12/0.35
% 0.12/0.35 # -------------------------------------------------
% 0.12/0.35 # User time : 0.009 s
% 0.12/0.35 # System time : 0.002 s
% 0.12/0.35 # Total time : 0.011 s
% 0.12/0.35 # Maximum resident set size: 1788 pages
% 0.12/0.35 % E---3.1 exiting
%------------------------------------------------------------------------------