↑ Up

CSE---1.7.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE---1.7
% Problem  : SYN047-1 : TPTP v8.2.0. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s

% Computer : n026.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 Jun 24 19:04:20 EDT 2024

% Result   : Unsatisfiable 0.54s 0.61s
% Output   : CNFRefutation 0.54s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SYN047-1 : TPTP v8.2.0. Released v1.0.0.
% 0.00/0.12  % Command    : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.12/0.33  % Computer : n026.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit   : 300
% 0.12/0.33  % WCLimit    : 300
% 0.12/0.33  % DateTime   : Mon Jun 24 00:09:09 EDT 2024
% 0.12/0.33  % CPUTime    : 
% 0.53/0.58  start to proof:theBenchmark
% 0.54/0.61  %-------------------------------------------
% 0.54/0.61  % File        :CSE---1.7
% 0.54/0.61  % Problem     :theBenchmark
% 0.54/0.61  % Transform   :cnf
% 0.54/0.61  % Format      :tptp:raw
% 0.54/0.61  % Command     :java -jar mcs_scs.jar %d %s
% 0.54/0.61  
% 0.54/0.61  % Result      :Theorem 0.000000s
% 0.54/0.61  % Output      :CNFRefutation 0.000000s
% 0.54/0.61  %-------------------------------------------
% 0.54/0.61  %--------------------------------------------------------------------------
% 0.54/0.61  % File     : SYN047-1 : TPTP v8.2.0. Released v1.0.0.
% 0.54/0.61  % Domain   : Syntactic
% 0.54/0.61  % Problem  : Pelletier Problem 17
% 0.54/0.61  % Version  : Especial.
% 0.54/0.61  % English  : A problem which appears to not be provable by [BBH72].
% 0.54/0.61  %            For details of why not, see [Pel82] p.135f.
% 0.54/0.61  
% 0.54/0.61  % Refs     : Bledsoe W., Boyer R., Nenneman W. (1972), Computer Proofs of
% 0.54/0.61  %          : [Pel82] Pelletier (1982), Completely Non-clausal, Completely H
% 0.54/0.61  %          : [Pel86] Pelletier (1986), Seventy-five Problems for Testing Au
% 0.54/0.61  % Source   : [Pel86]
% 0.54/0.61  % Names    : Pelletier 17 [Pel86]
% 0.54/0.61  
% 0.54/0.61  % Status   : Unsatisfiable
% 0.54/0.61  % Rating   : 0.00 v2.0.0
% 0.54/0.61  % Syntax   : Number of clauses     :    5 (   2 unt;   1 nHn;   5 RR)
% 0.54/0.61  %            Number of literals    :   10 (   0 equ;   5 neg)
% 0.54/0.61  %            Maximal clause size   :    3 (   2 avg)
% 0.54/0.61  %            Maximal term depth    :    0 (   0 avg)
% 0.54/0.61  %            Number of predicates  :    4 (   4 usr;   4 prp; 0-0 aty)
% 0.54/0.61  %            Number of functors    :    0 (   0 usr;   0 con; --- aty)
% 0.54/0.61  %            Number of variables   :    0 (   0 sgn)
% 0.54/0.61  % SPC      : CNF_UNS_PRP
% 0.54/0.61  
% 0.54/0.61  % Comments :
% 0.54/0.61  %--------------------------------------------------------------------------
% 0.54/0.61  cnf(clause_1,negated_conjecture,
% 0.54/0.61      p ).
% 0.54/0.61  
% 0.54/0.61  cnf(clause_2,negated_conjecture,
% 0.54/0.61      ( ~ p
% 0.54/0.61      | q
% 0.54/0.61      | s ) ).
% 0.54/0.61  
% 0.54/0.61  cnf(clause_3,negated_conjecture,
% 0.54/0.61      ( ~ p
% 0.54/0.61      | ~ r
% 0.54/0.61      | s ) ).
% 0.54/0.61  
% 0.54/0.61  cnf(clause_4,negated_conjecture,
% 0.54/0.61      ~ s ).
% 0.54/0.61  
% 0.54/0.61  cnf(clause_5,negated_conjecture,
% 0.54/0.61      ( ~ q
% 0.54/0.61      | r ) ).
% 0.54/0.61  
% 0.54/0.61  %--------------------------------------------------------------------------
% 0.54/0.61  %-------------------------------------------
% 0.54/0.61  % Proof found
% 0.54/0.61  % SZS status Theorem for theBenchmark
% 0.54/0.61  % SZS output start Proof
% 0.54/0.61  %ClaNum:5(EqnAxiom:0)
% 0.54/0.61  %VarNum:0(SingletonVarNum:0)
% 0.54/0.61  %MaxLitNum:3
% 0.54/0.61  %MaxfuncDepth:0
% 0.54/0.61  %SharedTerms:9
% 0.54/0.61  %goalClause: 1 2 3 4 5
% 0.54/0.61  %singleGoalClaCount:2
% 0.54/0.61  [1]P1(a5000)
% 0.54/0.61  [2]~P2(a5000)
% 0.54/0.61  [3]P3(a5000)+~P4(a5000)
% 0.54/0.61  [4]P4(a5000)+P2(a5000)+~P1(a5000)
% 0.54/0.61  [5]P2(a5000)+~P1(a5000)+~P3(a5000)
% 0.54/0.61  %EqnAxiom
% 0.54/0.61  
% 0.54/0.61  %-------------------------------------------
% 0.54/0.62  cnf(8,plain,
% 0.54/0.62     ($false),
% 0.54/0.62     inference(scs_inference,[],[1,2,5,3,4]),
% 0.54/0.62     ['proof']).
% 0.54/0.62  % SZS output end Proof
% 0.54/0.62  % Total time :0.000000s
%------------------------------------------------------------------------------