TSTP Solution File: SYN041-1 by CSE_E---1.5

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : SYN041-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s

% 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 Sep  1 01:49:14 EDT 2023

% Result   : Unsatisfiable 0.21s 0.59s
% Output   : CNFRefutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    2
%            Number of leaves      :    4
% Syntax   : Number of formulae    :    7 (   5 unt;   2 typ;   0 def)
%            Number of atoms       :    5 (   0 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    2 (   2   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    2 (   1 avg)
%            Maximal term depth    :    0 (   0 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    3 (   2 usr;   3 prp; 0-0 aty)
%            Number of functors    :    0 (   0 usr;   0 con; --- aty)
%            Number of variables   :    0 (   0 sgn;   0   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
tff(decl_22,type,
    p: $o ).

tff(decl_23,type,
    q: $o ).

cnf(clause_4,negated_conjecture,
    ~ p,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_4) ).

cnf(clause_1,negated_conjecture,
    p,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_1) ).

cnf(c_0_2,negated_conjecture,
    ~ p,
    clause_4 ).

cnf(c_0_3,negated_conjecture,
    p,
    clause_1 ).

cnf(c_0_4,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_2,c_0_3])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem    : SYN041-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.14  % Command    : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.13/0.35  % Computer : n027.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   : Sat Aug 26 20:07:20 EDT 2023
% 0.13/0.35  % CPUTime  : 
% 0.21/0.58  start to proof: theBenchmark
% 0.21/0.59  % Version  : CSE_E---1.5
% 0.21/0.59  % Problem  : theBenchmark.p
% 0.21/0.59  % Proof found
% 0.21/0.59  % SZS status Theorem for theBenchmark.p
% 0.21/0.59  % SZS output start Proof
% See solution above
% 0.21/0.59  % Total time : 0.003000 s
% 0.21/0.59  % SZS output end Proof
% 0.21/0.59  % Total time : 0.005000 s
%------------------------------------------------------------------------------