TSTP Solution File: GEO047-3 by E-SAT---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E-SAT---3.1.00
% Problem  : GEO047-3 : TPTP v8.2.0. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n020.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:19 EDT 2024

% Result   : Unsatisfiable 0.19s 0.48s
% Output   : CNFRefutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    5
% Syntax   : Number of clauses     :   18 (  11 unt;   0 nHn;  18 RR)
%            Number of literals    :   28 (   0 equ;  13 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-3 aty)
%            Number of functors    :    4 (   4 usr;   4 con; 0-0 aty)
%            Number of variables   :   22 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(t1,axiom,
    ( between(X3,X2,X1)
    | ~ between(X1,X2,X3) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t1) ).

cnf(b8,axiom,
    ( between(X1,X4,X3)
    | ~ between(X1,X2,X3)
    | ~ between(X2,X4,X3) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b8) ).

cnf(v_between_u_and_w,hypothesis,
    between(u,v,w),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',v_between_u_and_w) ).

cnf(w_between_u_and_x,hypothesis,
    between(u,w,x),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',w_between_u_and_x) ).

cnf(prove_v_between_u_and_x,negated_conjecture,
    ~ between(u,v,x),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_v_between_u_and_x) ).

cnf(c_0_5,plain,
    ( between(X3,X2,X1)
    | ~ between(X1,X2,X3) ),
    inference(fof_simplification,[status(thm)],[t1]) ).

cnf(c_0_6,plain,
    ( between(X1,X4,X3)
    | ~ between(X1,X2,X3)
    | ~ between(X2,X4,X3) ),
    inference(fof_simplification,[status(thm)],[b8]) ).

cnf(c_0_7,plain,
    ( between(X3,X2,X1)
    | ~ between(X1,X2,X3) ),
    c_0_5 ).

cnf(c_0_8,hypothesis,
    between(u,v,w),
    v_between_u_and_w ).

cnf(c_0_9,plain,
    ( between(X1,X4,X3)
    | ~ between(X1,X2,X3)
    | ~ between(X2,X4,X3) ),
    c_0_6 ).

cnf(c_0_10,hypothesis,
    between(w,v,u),
    inference(spm,[status(thm)],[c_0_7,c_0_8]) ).

cnf(c_0_11,hypothesis,
    between(u,w,x),
    w_between_u_and_x ).

cnf(c_0_12,hypothesis,
    ( between(X1,v,u)
    | ~ between(X1,w,u) ),
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_13,hypothesis,
    between(x,w,u),
    inference(spm,[status(thm)],[c_0_7,c_0_11]) ).

cnf(c_0_14,negated_conjecture,
    ~ between(u,v,x),
    inference(fof_simplification,[status(thm)],[prove_v_between_u_and_x]) ).

cnf(c_0_15,hypothesis,
    between(x,v,u),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_16,negated_conjecture,
    ~ between(u,v,x),
    c_0_14 ).

cnf(c_0_17,hypothesis,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_15]),c_0_16]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : GEO047-3 : TPTP v8.2.0. Released v1.0.0.
% 0.03/0.13  % Command    : run_E %s %d THM
% 0.13/0.34  % Computer : n020.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   : 300
% 0.13/0.34  % WCLimit    : 300
% 0.13/0.34  % DateTime   : Sun May 19 14:49:38 EDT 2024
% 0.13/0.34  % CPUTime    : 
% 0.19/0.46  Running first-order model finding
% 0.19/0.47  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.19/0.48  # Version: 3.1.0
% 0.19/0.48  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.48  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.48  # Starting new_bool_3 with 300s (1) cores
% 0.19/0.48  # Starting new_bool_1 with 300s (1) cores
% 0.19/0.48  # Starting sh5l with 300s (1) cores
% 0.19/0.48  # new_bool_3 with pid 22577 completed with status 0
% 0.19/0.48  # Result found by new_bool_3
% 0.19/0.48  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.48  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.48  # Starting new_bool_3 with 300s (1) cores
% 0.19/0.48  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.48  # Search class: FGUSS-FFSF00-SFFFFFNN
% 0.19/0.48  # partial match(1): FGUSF-FFSF00-SFFFFFNN
% 0.19/0.48  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.48  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.19/0.48  # SAT001_MinMin_p005000_rr_RG with pid 22581 completed with status 0
% 0.19/0.48  # Result found by SAT001_MinMin_p005000_rr_RG
% 0.19/0.48  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.48  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.48  # Starting new_bool_3 with 300s (1) cores
% 0.19/0.48  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.48  # Search class: FGUSS-FFSF00-SFFFFFNN
% 0.19/0.48  # partial match(1): FGUSF-FFSF00-SFFFFFNN
% 0.19/0.48  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.48  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.19/0.48  # Preprocessing time       : 0.001 s
% 0.19/0.48  # Presaturation interreduction done
% 0.19/0.48  
% 0.19/0.48  # Proof found!
% 0.19/0.48  # SZS status Unsatisfiable
% 0.19/0.48  # SZS output start CNFRefutation
% See solution above
% 0.19/0.48  # Parsed axioms                        : 59
% 0.19/0.48  # Removed by relevancy pruning/SinE    : 42
% 0.19/0.48  # Initial clauses                      : 17
% 0.19/0.48  # Removed in clause preprocessing      : 1
% 0.19/0.48  # Initial clauses in saturation        : 16
% 0.19/0.48  # Processed clauses                    : 49
% 0.19/0.48  # ...of these trivial                  : 0
% 0.19/0.48  # ...subsumed                          : 4
% 0.19/0.48  # ...remaining for further processing  : 45
% 0.19/0.48  # Other redundant clauses eliminated   : 1
% 0.19/0.48  # Clauses deleted for lack of memory   : 0
% 0.19/0.48  # Backward-subsumed                    : 0
% 0.19/0.48  # Backward-rewritten                   : 0
% 0.19/0.48  # Generated clauses                    : 57
% 0.19/0.48  # ...of the previous two non-redundant : 35
% 0.19/0.48  # ...aggressively subsumed             : 0
% 0.19/0.48  # Contextual simplify-reflections      : 0
% 0.19/0.48  # Paramodulations                      : 56
% 0.19/0.48  # Factorizations                       : 0
% 0.19/0.48  # NegExts                              : 0
% 0.19/0.48  # Equation resolutions                 : 1
% 0.19/0.48  # Disequality decompositions           : 0
% 0.19/0.48  # Total rewrite steps                  : 17
% 0.19/0.48  # ...of those cached                   : 8
% 0.19/0.48  # Propositional unsat checks           : 0
% 0.19/0.48  #    Propositional check models        : 0
% 0.19/0.48  #    Propositional check unsatisfiable : 0
% 0.19/0.48  #    Propositional clauses             : 0
% 0.19/0.48  #    Propositional clauses after purity: 0
% 0.19/0.48  #    Propositional unsat core size     : 0
% 0.19/0.48  #    Propositional preprocessing time  : 0.000
% 0.19/0.48  #    Propositional encoding time       : 0.000
% 0.19/0.48  #    Propositional solver time         : 0.000
% 0.19/0.48  #    Success case prop preproc time    : 0.000
% 0.19/0.48  #    Success case prop encoding time   : 0.000
% 0.19/0.48  #    Success case prop solver time     : 0.000
% 0.19/0.48  # Current number of processed clauses  : 30
% 0.19/0.48  #    Positive orientable unit clauses  : 7
% 0.19/0.48  #    Positive unorientable unit clauses: 0
% 0.19/0.48  #    Negative unit clauses             : 1
% 0.19/0.48  #    Non-unit-clauses                  : 22
% 0.19/0.48  # Current number of unprocessed clauses: 12
% 0.19/0.48  # ...number of literals in the above   : 32
% 0.19/0.48  # Current number of archived formulas  : 0
% 0.19/0.48  # Current number of archived clauses   : 14
% 0.19/0.48  # Clause-clause subsumption calls (NU) : 232
% 0.19/0.48  # Rec. Clause-clause subsumption calls : 196
% 0.19/0.48  # Non-unit clause-clause subsumptions  : 4
% 0.19/0.48  # Unit Clause-clause subsumption calls : 0
% 0.19/0.48  # Rewrite failures with RHS unbound    : 0
% 0.19/0.48  # BW rewrite match attempts            : 15
% 0.19/0.48  # BW rewrite match successes           : 0
% 0.19/0.48  # Condensation attempts                : 0
% 0.19/0.48  # Condensation successes               : 0
% 0.19/0.48  # Termbank termtop insertions          : 1277
% 0.19/0.48  # Search garbage collected termcells   : 232
% 0.19/0.48  
% 0.19/0.48  # -------------------------------------------------
% 0.19/0.48  # User time                : 0.004 s
% 0.19/0.48  # System time              : 0.001 s
% 0.19/0.48  # Total time               : 0.005 s
% 0.19/0.48  # Maximum resident set size: 1756 pages
% 0.19/0.48  
% 0.19/0.48  # -------------------------------------------------
% 0.19/0.48  # User time                : 0.005 s
% 0.19/0.48  # System time              : 0.004 s
% 0.19/0.48  # Total time               : 0.009 s
% 0.19/0.48  # Maximum resident set size: 1740 pages
% 0.19/0.48  % E---3.1 exiting
%------------------------------------------------------------------------------