TSTP Solution File: GEO007-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : GEO007-1 : TPTP v8.2.0. Bugfixed v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n021.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:02 EDT 2024
% Result : Unsatisfiable 0.21s 0.51s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 13
% Syntax : Number of clauses : 50 ( 23 unt; 7 nHn; 44 RR)
% Number of literals : 98 ( 14 equ; 47 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-4 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-5 aty)
% Number of variables : 104 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(identity_for_betweeness,axiom,
( X1 = X2
| ~ between(X1,X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO001-0.ax',identity_for_betweeness) ).
cnf(outer_pasch1,axiom,
( between(X1,outer_pasch(X2,X1,X4,X5,X3),X4)
| ~ between(X1,X2,X3)
| ~ between(X4,X3,X5) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO001-0.ax',outer_pasch1) ).
cnf(identity_for_equidistance,axiom,
( X1 = X2
| ~ equidistant(X1,X2,X3,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO001-0.ax',identity_for_equidistance) ).
cnf(outer_pasch2,axiom,
( between(X5,X2,outer_pasch(X2,X1,X4,X5,X3))
| ~ between(X1,X2,X3)
| ~ between(X4,X3,X5) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO001-0.ax',outer_pasch2) ).
cnf(segment_construction2,axiom,
equidistant(X1,extension(X2,X1,X3,X4),X3,X4),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO001-0.ax',segment_construction2) ).
cnf(segment_construction1,axiom,
between(X1,X2,extension(X1,X2,X3,X4)),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO001-0.ax',segment_construction1) ).
cnf(connectivity_for_betweeness,axiom,
( X1 = X2
| between(X1,X3,X4)
| between(X1,X4,X3)
| ~ between(X1,X2,X3)
| ~ between(X1,X2,X4) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO001-0.ax',connectivity_for_betweeness) ).
cnf(a_between_a_and_e,hypothesis,
between(e,a,c),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_between_a_and_e) ).
cnf(a_not_c,hypothesis,
a != c,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_not_c) ).
cnf(a_between_a_and_c,hypothesis,
between(d,a,c),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_between_a_and_c) ).
cnf(transitivity_for_betweeness,axiom,
( between(X1,X2,X4)
| ~ between(X1,X2,X3)
| ~ between(X2,X4,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO001-0.ax',transitivity_for_betweeness) ).
cnf(prove_d_between_e_and_a,negated_conjecture,
~ between(e,d,a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_d_between_e_and_a) ).
cnf(e_not_between_d_and_a,hypothesis,
~ between(d,e,a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',e_not_between_d_and_a) ).
cnf(c_0_13,plain,
( X1 = X2
| ~ between(X1,X2,X1) ),
inference(fof_simplification,[status(thm)],[identity_for_betweeness]) ).
cnf(c_0_14,plain,
( between(X1,outer_pasch(X2,X1,X4,X5,X3),X4)
| ~ between(X1,X2,X3)
| ~ between(X4,X3,X5) ),
inference(fof_simplification,[status(thm)],[outer_pasch1]) ).
cnf(c_0_15,plain,
( X1 = X2
| ~ equidistant(X1,X2,X3,X3) ),
inference(fof_simplification,[status(thm)],[identity_for_equidistance]) ).
cnf(c_0_16,plain,
( between(X5,X2,outer_pasch(X2,X1,X4,X5,X3))
| ~ between(X1,X2,X3)
| ~ between(X4,X3,X5) ),
inference(fof_simplification,[status(thm)],[outer_pasch2]) ).
cnf(c_0_17,plain,
( X1 = X2
| ~ between(X1,X2,X1) ),
c_0_13 ).
cnf(c_0_18,plain,
( between(X1,outer_pasch(X2,X1,X4,X5,X3),X4)
| ~ between(X1,X2,X3)
| ~ between(X4,X3,X5) ),
c_0_14 ).
cnf(c_0_19,plain,
( X1 = X2
| ~ equidistant(X1,X2,X3,X3) ),
c_0_15 ).
cnf(c_0_20,axiom,
equidistant(X1,extension(X2,X1,X3,X4),X3,X4),
segment_construction2 ).
cnf(c_0_21,plain,
( between(X5,X2,outer_pasch(X2,X1,X4,X5,X3))
| ~ between(X1,X2,X3)
| ~ between(X4,X3,X5) ),
c_0_16 ).
cnf(c_0_22,plain,
( outer_pasch(X1,X2,X2,X3,X4) = X2
| ~ between(X2,X4,X3)
| ~ between(X2,X1,X4) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_23,axiom,
between(X1,X2,extension(X1,X2,X3,X4)),
segment_construction1 ).
cnf(c_0_24,plain,
extension(X1,X2,X3,X3) = X2,
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,plain,
( between(X1,X2,X3)
| ~ between(X3,X4,X1)
| ~ between(X3,X2,X4) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,plain,
between(X1,X2,X2),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_27,plain,
( X1 = X2
| between(X1,X3,X4)
| between(X1,X4,X3)
| ~ between(X1,X2,X3)
| ~ between(X1,X2,X4) ),
inference(fof_simplification,[status(thm)],[connectivity_for_betweeness]) ).
cnf(c_0_28,plain,
( between(X1,X2,X3)
| ~ between(X3,X2,X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_29,hypothesis,
between(e,a,c),
a_between_a_and_e ).
cnf(c_0_30,hypothesis,
a != c,
inference(fof_simplification,[status(thm)],[a_not_c]) ).
cnf(c_0_31,plain,
( X1 = X2
| between(X1,X3,X4)
| between(X1,X4,X3)
| ~ between(X1,X2,X3)
| ~ between(X1,X2,X4) ),
c_0_27 ).
cnf(c_0_32,hypothesis,
between(c,a,e),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_33,hypothesis,
a != c,
c_0_30 ).
cnf(c_0_34,hypothesis,
between(d,a,c),
a_between_a_and_c ).
cnf(c_0_35,hypothesis,
( between(c,X1,e)
| between(c,e,X1)
| ~ between(c,a,X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]) ).
cnf(c_0_36,hypothesis,
between(c,a,d),
inference(spm,[status(thm)],[c_0_28,c_0_34]) ).
cnf(c_0_37,plain,
( between(X1,X2,X4)
| ~ between(X1,X2,X3)
| ~ between(X2,X4,X3) ),
inference(fof_simplification,[status(thm)],[transitivity_for_betweeness]) ).
cnf(c_0_38,hypothesis,
( between(c,e,d)
| between(c,d,e) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_39,plain,
( between(X1,X2,X4)
| ~ between(X1,X2,X3)
| ~ between(X2,X4,X3) ),
c_0_37 ).
cnf(c_0_40,hypothesis,
( between(c,d,e)
| between(d,e,c) ),
inference(spm,[status(thm)],[c_0_28,c_0_38]) ).
cnf(c_0_41,negated_conjecture,
~ between(e,d,a),
inference(fof_simplification,[status(thm)],[prove_d_between_e_and_a]) ).
cnf(c_0_42,hypothesis,
( between(X1,d,a)
| ~ between(X1,d,c) ),
inference(spm,[status(thm)],[c_0_39,c_0_34]) ).
cnf(c_0_43,hypothesis,
( between(d,e,c)
| between(e,d,c) ),
inference(spm,[status(thm)],[c_0_28,c_0_40]) ).
cnf(c_0_44,negated_conjecture,
~ between(e,d,a),
c_0_41 ).
cnf(c_0_45,hypothesis,
~ between(d,e,a),
inference(fof_simplification,[status(thm)],[e_not_between_d_and_a]) ).
cnf(c_0_46,hypothesis,
( between(X1,e,a)
| ~ between(X1,e,c) ),
inference(spm,[status(thm)],[c_0_39,c_0_29]) ).
cnf(c_0_47,hypothesis,
between(d,e,c),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44]) ).
cnf(c_0_48,hypothesis,
~ between(d,e,a),
c_0_45 ).
cnf(c_0_49,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_48]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GEO007-1 : TPTP v8.2.0. Bugfixed v2.5.0.
% 0.11/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n021.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sun May 19 14:12:53 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.21/0.48 Running first-order model finding
% 0.21/0.48 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/benchmark/theBenchmark.p
% 0.21/0.51 # Version: 3.1.0
% 0.21/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.51 # Starting sh5l with 300s (1) cores
% 0.21/0.51 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 12404 completed with status 0
% 0.21/0.51 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.21/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.51 # No SInE strategy applied
% 0.21/0.51 # Search class: FGUSS-FFMF33-SFFFFFNN
% 0.21/0.51 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.51 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with 888s (1) cores
% 0.21/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.21/0.51 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 136s (1) cores
% 0.21/0.51 # Starting 208_C09_12_F1_SE_CS_SP_PS_S070I with 136s (1) cores
% 0.21/0.51 # Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 0.21/0.51 # SAT001_MinMin_p005000_rr_RG with pid 12415 completed with status 0
% 0.21/0.51 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.21/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.51 # No SInE strategy applied
% 0.21/0.51 # Search class: FGUSS-FFMF33-SFFFFFNN
% 0.21/0.51 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.51 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with 888s (1) cores
% 0.21/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.21/0.51 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 136s (1) cores
% 0.21/0.51 # Starting 208_C09_12_F1_SE_CS_SP_PS_S070I with 136s (1) cores
% 0.21/0.51 # Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 0.21/0.51 # Preprocessing time : 0.002 s
% 0.21/0.51 # Presaturation interreduction done
% 0.21/0.51
% 0.21/0.51 # Proof found!
% 0.21/0.51 # SZS status Unsatisfiable
% 0.21/0.51 # SZS output start CNFRefutation
% See solution above
% 0.21/0.51 # Parsed axioms : 25
% 0.21/0.51 # Removed by relevancy pruning/SinE : 0
% 0.21/0.51 # Initial clauses : 25
% 0.21/0.51 # Removed in clause preprocessing : 0
% 0.21/0.51 # Initial clauses in saturation : 25
% 0.21/0.51 # Processed clauses : 95
% 0.21/0.51 # ...of these trivial : 2
% 0.21/0.51 # ...subsumed : 3
% 0.21/0.51 # ...remaining for further processing : 90
% 0.21/0.51 # Other redundant clauses eliminated : 0
% 0.21/0.51 # Clauses deleted for lack of memory : 0
% 0.21/0.51 # Backward-subsumed : 0
% 0.21/0.51 # Backward-rewritten : 2
% 0.21/0.51 # Generated clauses : 235
% 0.21/0.51 # ...of the previous two non-redundant : 167
% 0.21/0.51 # ...aggressively subsumed : 0
% 0.21/0.51 # Contextual simplify-reflections : 0
% 0.21/0.51 # Paramodulations : 235
% 0.21/0.51 # Factorizations : 0
% 0.21/0.51 # NegExts : 0
% 0.21/0.51 # Equation resolutions : 0
% 0.21/0.51 # Disequality decompositions : 0
% 0.21/0.51 # Total rewrite steps : 72
% 0.21/0.51 # ...of those cached : 43
% 0.21/0.51 # Propositional unsat checks : 0
% 0.21/0.51 # Propositional check models : 0
% 0.21/0.51 # Propositional check unsatisfiable : 0
% 0.21/0.51 # Propositional clauses : 0
% 0.21/0.51 # Propositional clauses after purity: 0
% 0.21/0.51 # Propositional unsat core size : 0
% 0.21/0.51 # Propositional preprocessing time : 0.000
% 0.21/0.51 # Propositional encoding time : 0.000
% 0.21/0.51 # Propositional solver time : 0.000
% 0.21/0.51 # Success case prop preproc time : 0.000
% 0.21/0.51 # Success case prop encoding time : 0.000
% 0.21/0.51 # Success case prop solver time : 0.000
% 0.21/0.51 # Current number of processed clauses : 63
% 0.21/0.51 # Positive orientable unit clauses : 20
% 0.21/0.51 # Positive unorientable unit clauses: 0
% 0.21/0.51 # Negative unit clauses : 6
% 0.21/0.51 # Non-unit-clauses : 37
% 0.21/0.51 # Current number of unprocessed clauses: 118
% 0.21/0.51 # ...number of literals in the above : 500
% 0.21/0.51 # Current number of archived formulas : 0
% 0.21/0.51 # Current number of archived clauses : 27
% 0.21/0.51 # Clause-clause subsumption calls (NU) : 648
% 0.21/0.51 # Rec. Clause-clause subsumption calls : 398
% 0.21/0.51 # Non-unit clause-clause subsumptions : 3
% 0.21/0.51 # Unit Clause-clause subsumption calls : 86
% 0.21/0.51 # Rewrite failures with RHS unbound : 0
% 0.21/0.51 # BW rewrite match attempts : 254
% 0.21/0.51 # BW rewrite match successes : 1
% 0.21/0.51 # Condensation attempts : 0
% 0.21/0.51 # Condensation successes : 0
% 0.21/0.51 # Termbank termtop insertions : 3547
% 0.21/0.51 # Search garbage collected termcells : 84
% 0.21/0.51
% 0.21/0.51 # -------------------------------------------------
% 0.21/0.51 # User time : 0.011 s
% 0.21/0.51 # System time : 0.004 s
% 0.21/0.51 # Total time : 0.015 s
% 0.21/0.51 # Maximum resident set size: 1668 pages
% 0.21/0.51
% 0.21/0.51 # -------------------------------------------------
% 0.21/0.51 # User time : 0.059 s
% 0.21/0.51 # System time : 0.014 s
% 0.21/0.51 # Total time : 0.073 s
% 0.21/0.51 # Maximum resident set size: 1720 pages
% 0.21/0.51 % E---3.1 exiting
%------------------------------------------------------------------------------