TSTP Solution File: SWV001-1 by iProver---3.9

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : iProver---3.9
% Problem  : SWV001-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover %s %d THM

% Computer : n002.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 03:13:15 EDT 2024

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

% Comments : 
%------------------------------------------------------------------------------
cnf(c_51,plain,
    ( ~ q1(X0,X1,X2)
    | ~ less_or_equalish(X0,X1)
    | q2(X0,X1,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_1) ).

cnf(c_52,plain,
    ( ~ q1(X0,X1,X2)
    | q3(X0,X1,X2)
    | less_or_equalish(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_2) ).

cnf(c_53,plain,
    ( ~ q2(X0,X1,X2)
    | q4(X0,X1,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_3) ).

cnf(c_54,plain,
    ( ~ q3(X0,X1,X2)
    | q4(X0,X1,X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_4) ).

cnf(c_55,plain,
    less_or_equalish(X0,X0),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_or_equal_reflexivity) ).

cnf(c_58,plain,
    ( less_or_equalish(X0,X1)
    | less_or_equalish(X1,X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',all_less_or_equal) ).

cnf(c_60,negated_conjecture,
    q1(a,b,c),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_5) ).

cnf(c_61,negated_conjecture,
    ( ~ q4(a,b,X0)
    | ~ less_or_equalish(X0,a)
    | ~ less_or_equalish(a,X0)
    | ~ less_or_equalish(b,X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_6) ).

cnf(c_62,negated_conjecture,
    ( ~ q4(a,b,X0)
    | ~ less_or_equalish(X0,b)
    | ~ less_or_equalish(a,X0)
    | ~ less_or_equalish(b,X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_7) ).

cnf(c_63,plain,
    less_or_equalish(a,a),
    inference(instantiation,[status(thm)],[c_55]) ).

cnf(c_142,plain,
    ( ~ q1(X0,X1,X2)
    | ~ less_or_equalish(X0,X1)
    | q4(X0,X1,X1) ),
    inference(resolution,[status(thm)],[c_51,c_53]) ).

cnf(c_156,plain,
    ( ~ q1(X0,X1,X2)
    | q4(X0,X1,X0)
    | less_or_equalish(X0,X1) ),
    inference(resolution,[status(thm)],[c_52,c_54]) ).

cnf(c_169,plain,
    ( q4(a,b,a)
    | less_or_equalish(a,b) ),
    inference(resolution,[status(thm)],[c_156,c_60]) ).

cnf(c_176,plain,
    ( ~ less_or_equalish(a,b)
    | q4(a,b,b) ),
    inference(resolution,[status(thm)],[c_142,c_60]) ).

cnf(c_191,plain,
    ( ~ less_or_equalish(a,a)
    | ~ less_or_equalish(b,a)
    | less_or_equalish(a,b) ),
    inference(resolution,[status(thm)],[c_61,c_169]) ).

cnf(c_192,plain,
    ( ~ less_or_equalish(b,a)
    | less_or_equalish(a,b) ),
    inference(global_subsumption_just,[status(thm)],[c_191,c_63,c_191]) ).

cnf(c_198,plain,
    less_or_equalish(a,b),
    inference(forward_subsumption_resolution,[status(thm)],[c_192,c_58]) ).

cnf(c_200,plain,
    ( ~ less_or_equalish(a,b)
    | ~ less_or_equalish(b,b) ),
    inference(resolution,[status(thm)],[c_62,c_176]) ).

cnf(c_201,plain,
    ~ less_or_equalish(b,b),
    inference(global_subsumption_just,[status(thm)],[c_200,c_198,c_200]) ).

cnf(c_205,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_201,c_55]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SWV001-1 : TPTP v8.1.2. Released v1.0.0.
% 0.07/0.13  % Command  : run_iprover %s %d THM
% 0.13/0.34  % Computer : n002.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 : Fri May  3 00:29:27 EDT 2024
% 0.13/0.35  % CPUTime  : 
% 0.20/0.47  Running first-order theorem proving
% 0.20/0.47  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
% 0.48/1.17  % SZS status Started for theBenchmark.p
% 0.48/1.17  % SZS status Unsatisfiable for theBenchmark.p
% 0.48/1.17  
% 0.48/1.17  %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.48/1.17  
% 0.48/1.17  ------  iProver source info
% 0.48/1.17  
% 0.48/1.17  git: date: 2024-05-02 19:28:25 +0000
% 0.48/1.17  git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.48/1.17  git: non_committed_changes: false
% 0.48/1.17  
% 0.48/1.17  ------ Parsing...successful
% 0.48/1.17  
% 0.48/1.17  ------  preprocesses with Option_epr_non_horn_non_eq
% 0.48/1.17  
% 0.48/1.17  
% 0.48/1.17  ------ Preprocessing... sf_s  rm: 0 0s  sf_e  pe_s  pe:1:0s pe:2:0s pe:4:0s
% 0.48/1.17  
% 0.48/1.17  % SZS status Unsatisfiable for theBenchmark.p
% 0.48/1.17  
% 0.48/1.17  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.48/1.17  
% 0.48/1.17  
%------------------------------------------------------------------------------