TSTP Solution File: FLD061-2 by iProver---3.9

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : iProver---3.9
% Problem  : FLD061-2 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover %s %d THM

% Computer : n027.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 : Fri May  3 02:15:26 EDT 2024

% Result   : Unsatisfiable 70.52s 10.24s
% Output   : CNFRefutation 70.52s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :   14
% Syntax   : Number of clauses     :   37 (  10 unt;   2 nHn;  37 RR)
%            Number of literals    :   91 (   0 equ;  53 neg)
%            Maximal clause size   :    4 (   2 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   6 con; 0-2 aty)
%            Number of variables   :   31 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(c_50,plain,
    defined(b),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',b_is_defined) ).

cnf(c_51,plain,
    defined(c),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_is_defined) ).

cnf(c_54,plain,
    defined(v),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',v_is_defined) ).

cnf(c_55,negated_conjecture,
    equalish(add(a,c),u),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',add_equals_u_7) ).

cnf(c_56,negated_conjecture,
    equalish(add(d,b),v),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',add_equals_v_8) ).

cnf(c_57,negated_conjecture,
    less_or_equal(a,b),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_or_equal_9) ).

cnf(c_58,negated_conjecture,
    less_or_equal(c,d),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_or_equal_10) ).

cnf(c_59,negated_conjecture,
    ~ less_or_equal(u,v),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_less_or_equal_11) ).

cnf(c_63,plain,
    ( ~ defined(X0)
    | ~ defined(X1)
    | equalish(add(X0,X1),add(X1,X0)) ),
    file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',commutativity_addition) ).

cnf(c_76,plain,
    ( ~ less_or_equal(X0,X1)
    | ~ less_or_equal(X1,X2)
    | less_or_equal(X0,X2) ),
    file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',transitivity_of_order_relation) ).

cnf(c_77,plain,
    ( ~ defined(X0)
    | ~ defined(X1)
    | less_or_equal(X0,X1)
    | less_or_equal(X1,X0) ),
    file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',totality_of_order_relation) ).

cnf(c_78,plain,
    ( ~ less_or_equal(X0,X1)
    | ~ defined(X2)
    | less_or_equal(add(X0,X2),add(X1,X2)) ),
    file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',compatibility_of_order_relation_and_addition) ).

cnf(c_81,plain,
    ( ~ equalish(X0,X1)
    | equalish(X1,X0) ),
    file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',symmetry_of_equality) ).

cnf(c_85,plain,
    ( ~ equalish(X0,X1)
    | ~ less_or_equal(X0,X2)
    | less_or_equal(X1,X2) ),
    file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',compatibility_of_equality_and_order_relation) ).

cnf(c_113,plain,
    ( ~ equalish(X0,u)
    | ~ less_or_equal(X0,v)
    | less_or_equal(u,v) ),
    inference(instantiation,[status(thm)],[c_85]) ).

cnf(c_120,plain,
    ( ~ defined(X0)
    | ~ defined(v)
    | less_or_equal(X0,v)
    | less_or_equal(v,X0) ),
    inference(instantiation,[status(thm)],[c_77]) ).

cnf(c_123,plain,
    ( ~ equalish(X0,X1)
    | ~ less_or_equal(X0,v)
    | less_or_equal(X1,v) ),
    inference(instantiation,[status(thm)],[c_85]) ).

cnf(c_142,plain,
    ( ~ defined(v)
    | less_or_equal(v,v) ),
    inference(instantiation,[status(thm)],[c_120]) ).

cnf(c_227,plain,
    ( ~ less_or_equal(add(a,c),X0)
    | ~ less_or_equal(X0,X1)
    | less_or_equal(add(a,c),X1) ),
    inference(instantiation,[status(thm)],[c_76]) ).

cnf(c_231,plain,
    ( ~ less_or_equal(a,X0)
    | ~ defined(c)
    | less_or_equal(add(a,c),add(X0,c)) ),
    inference(instantiation,[status(thm)],[c_78]) ).

cnf(c_236,plain,
    ( ~ equalish(add(a,c),u)
    | ~ less_or_equal(add(a,c),v)
    | less_or_equal(u,v) ),
    inference(instantiation,[status(thm)],[c_113]) ).

cnf(c_519,plain,
    equalish(v,add(d,b)),
    inference(resolution,[status(thm)],[c_81,c_56]) ).

cnf(c_577,plain,
    ( ~ less_or_equal(a,b)
    | ~ defined(c)
    | less_or_equal(add(a,c),add(b,c)) ),
    inference(instantiation,[status(thm)],[c_231]) ).

cnf(c_1589,plain,
    ( ~ less_or_equal(add(a,c),X0)
    | ~ less_or_equal(X0,v)
    | less_or_equal(add(a,c),v) ),
    inference(instantiation,[status(thm)],[c_227]) ).

cnf(c_6275,plain,
    ( ~ less_or_equal(add(a,c),add(b,c))
    | ~ less_or_equal(add(b,c),v)
    | less_or_equal(add(a,c),v) ),
    inference(instantiation,[status(thm)],[c_1589]) ).

cnf(c_12659,plain,
    ( ~ equalish(X0,add(b,c))
    | ~ less_or_equal(X0,v)
    | less_or_equal(add(b,c),v) ),
    inference(instantiation,[status(thm)],[c_123]) ).

cnf(c_20614,plain,
    ( ~ equalish(add(c,b),add(b,c))
    | ~ less_or_equal(add(c,b),v)
    | less_or_equal(add(b,c),v) ),
    inference(instantiation,[status(thm)],[c_12659]) ).

cnf(c_20615,plain,
    ( ~ defined(b)
    | ~ defined(c)
    | equalish(add(c,b),add(b,c)) ),
    inference(instantiation,[status(thm)],[c_63]) ).

cnf(c_113158,plain,
    ( ~ less_or_equal(X0,X1)
    | ~ less_or_equal(X1,v)
    | less_or_equal(X0,v) ),
    inference(instantiation,[status(thm)],[c_76]) ).

cnf(c_113159,plain,
    ( ~ equalish(X0,X1)
    | ~ less_or_equal(X0,v)
    | less_or_equal(X1,v) ),
    inference(instantiation,[status(thm)],[c_85]) ).

cnf(c_113276,plain,
    ( ~ equalish(v,X0)
    | ~ less_or_equal(v,v)
    | less_or_equal(X0,v) ),
    inference(instantiation,[status(thm)],[c_113159]) ).

cnf(c_115250,plain,
    ( ~ equalish(v,add(d,b))
    | ~ less_or_equal(v,v)
    | less_or_equal(add(d,b),v) ),
    inference(instantiation,[status(thm)],[c_113276]) ).

cnf(c_117806,plain,
    ( ~ less_or_equal(X0,add(d,b))
    | ~ less_or_equal(add(d,b),v)
    | less_or_equal(X0,v) ),
    inference(instantiation,[status(thm)],[c_113158]) ).

cnf(c_121170,plain,
    ( ~ less_or_equal(X0,d)
    | ~ defined(b)
    | less_or_equal(add(X0,b),add(d,b)) ),
    inference(instantiation,[status(thm)],[c_78]) ).

cnf(c_125299,plain,
    ( ~ less_or_equal(c,d)
    | ~ defined(b)
    | less_or_equal(add(c,b),add(d,b)) ),
    inference(instantiation,[status(thm)],[c_121170]) ).

cnf(c_127323,plain,
    ( ~ less_or_equal(add(c,b),add(d,b))
    | ~ less_or_equal(add(d,b),v)
    | less_or_equal(add(c,b),v) ),
    inference(instantiation,[status(thm)],[c_117806]) ).

cnf(c_127327,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_127323,c_125299,c_115250,c_20615,c_20614,c_6275,c_577,c_519,c_236,c_142,c_55,c_59,c_57,c_58,c_50,c_51,c_54]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem  : FLD061-2 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.11/0.11  % Command  : run_iprover %s %d THM
% 0.11/0.32  % Computer : n027.cluster.edu
% 0.11/0.32  % Model    : x86_64 x86_64
% 0.11/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32  % Memory   : 8042.1875MB
% 0.11/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32  % CPULimit : 300
% 0.11/0.32  % WCLimit  : 300
% 0.11/0.32  % DateTime : Thu May  2 23:00:50 EDT 2024
% 0.11/0.32  % CPUTime  : 
% 0.17/0.43  Running first-order theorem proving
% 0.17/0.43  Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 70.52/10.24  % SZS status Started for theBenchmark.p
% 70.52/10.24  % SZS status Unsatisfiable for theBenchmark.p
% 70.52/10.24  
% 70.52/10.24  %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 70.52/10.24  
% 70.52/10.24  ------  iProver source info
% 70.52/10.24  
% 70.52/10.24  git: date: 2024-05-02 19:28:25 +0000
% 70.52/10.24  git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 70.52/10.24  git: non_committed_changes: false
% 70.52/10.24  
% 70.52/10.24  ------ Parsing...successful
% 70.52/10.24  
% 70.52/10.24  
% 70.52/10.24  
% 70.52/10.24  ------ Preprocessing... sf_s  rm: 0 0s  sf_e 
% 70.52/10.24  
% 70.52/10.24  ------ Preprocessing...
% 70.52/10.24  ------ Proving...
% 70.52/10.24  ------ Problem Properties 
% 70.52/10.24  
% 70.52/10.24  
% 70.52/10.24  clauses                                 38
% 70.52/10.24  conjectures                             5
% 70.52/10.24  EPR                                     19
% 70.52/10.24  Horn                                    35
% 70.52/10.24  unary                                   14
% 70.52/10.24  binary                                  6
% 70.52/10.24  lits                                    84
% 70.52/10.24  lits eq                                 0
% 70.52/10.24  fd_pure                                 0
% 70.52/10.24  fd_pseudo                               0
% 70.52/10.24  fd_cond                                 0
% 70.52/10.24  fd_pseudo_cond                          0
% 70.52/10.24  AC symbols                              0
% 70.52/10.24  
% 70.52/10.24  ------ Input Options Time Limit: Unbounded
% 70.52/10.24  
% 70.52/10.24  
% 70.52/10.24  ------ 
% 70.52/10.24  Current options:
% 70.52/10.24  ------ 
% 70.52/10.24  
% 70.52/10.24  
% 70.52/10.24  
% 70.52/10.24  
% 70.52/10.24  ------ Proving...
% 70.52/10.24  
% 70.52/10.24  
% 70.52/10.24  % SZS status Unsatisfiable for theBenchmark.p
% 70.52/10.24  
% 70.52/10.24  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 70.52/10.25  
% 70.52/10.25  
%------------------------------------------------------------------------------