↑ Up

CSE---1.7.UNS-CRf.s

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

% Computer : n029.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:27 EDT 2024

% Result   : Unsatisfiable 0.52s 0.62s
% Output   : CNFRefutation 0.52s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : SYN069-1 : TPTP v8.2.0. Released v1.0.0.
% 0.03/0.12  % Command    : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.12/0.34  % Computer : n029.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit   : 300
% 0.12/0.34  % WCLimit    : 300
% 0.12/0.34  % DateTime   : Sun Jun 23 20:41:24 EDT 2024
% 0.12/0.34  % CPUTime    : 
% 0.52/0.58  start to proof:theBenchmark
% 0.52/0.61  %-------------------------------------------
% 0.52/0.61  % File        :CSE---1.7
% 0.52/0.61  % Problem     :theBenchmark
% 0.52/0.61  % Transform   :cnf
% 0.52/0.61  % Format      :tptp:raw
% 0.52/0.61  % Command     :java -jar mcs_scs.jar %d %s
% 0.52/0.61  
% 0.52/0.61  % Result      :Theorem 0.000000s
% 0.52/0.61  % Output      :CNFRefutation 0.000000s
% 0.52/0.61  %-------------------------------------------
% 0.52/0.62  %--------------------------------------------------------------------------
% 0.52/0.62  % File     : SYN069-1 : TPTP v8.2.0. Released v1.0.0.
% 0.52/0.62  % Domain   : Syntactic
% 0.52/0.62  % Problem  : Pelletier Problem 45
% 0.52/0.62  % Version  : Especial.
% 0.52/0.62  % English  :
% 0.52/0.62  
% 0.52/0.62  % Refs     : [KM64]  Kalish & Montegue (1964), Logic: Techniques of Formal
% 0.52/0.62  %          : [Pel86] Pelletier (1986), Seventy-five Problems for Testing Au
% 0.52/0.62  % Source   : [Pel86]
% 0.52/0.62  % Names    : Pelletier 45 [Pel86]
% 0.52/0.62  %          : p45.in [ANL]
% 0.52/0.62  
% 0.52/0.62  % Status   : Unsatisfiable
% 0.52/0.62  % Rating   : 0.00 v2.0.0
% 0.52/0.62  % Syntax   : Number of clauses     :    9 (   1 unt;   2 nHn;   9 RR)
% 0.52/0.62  %            Number of literals    :   27 (   0 equ;  17 neg)
% 0.52/0.62  %            Maximal clause size   :    5 (   3 avg)
% 0.52/0.62  %            Maximal term depth    :    2 (   1 avg)
% 0.52/0.62  %            Number of predicates  :    6 (   6 usr;   0 prp; 1-2 aty)
% 0.52/0.62  %            Number of functors    :    3 (   3 usr;   1 con; 0-1 aty)
% 0.52/0.62  %            Number of variables   :   11 (   0 sgn)
% 0.52/0.62  % SPC      : CNF_UNS_RFO_NEQ_NHN
% 0.52/0.62  
% 0.52/0.62  % Comments :
% 0.52/0.62  %--------------------------------------------------------------------------
% 0.52/0.62  cnf(clause_1,axiom,
% 0.52/0.62      ( ~ big_f(X)
% 0.52/0.62      | big_g(f(X))
% 0.52/0.62      | ~ big_g(Y)
% 0.52/0.62      | ~ big_h(X,Y)
% 0.52/0.62      | big_k(Y) ) ).
% 0.52/0.62  
% 0.52/0.62  cnf(clause_2,axiom,
% 0.52/0.62      ( ~ big_f(X)
% 0.52/0.62      | big_h(X,f(X))
% 0.52/0.62      | ~ big_g(Y)
% 0.52/0.62      | ~ big_h(X,Y)
% 0.52/0.62      | big_k(Y) ) ).
% 0.52/0.62  
% 0.52/0.62  cnf(clause_3,axiom,
% 0.52/0.62      ( ~ big_f(X)
% 0.52/0.62      | ~ big_j(X,f(X))
% 0.52/0.62      | ~ big_g(Y)
% 0.52/0.62      | ~ big_h(X,Y)
% 0.52/0.62      | big_k(Y) ) ).
% 0.52/0.62  
% 0.52/0.62  cnf(clause_4,axiom,
% 0.52/0.62      ( ~ big_l(X)
% 0.52/0.62      | ~ big_k(X) ) ).
% 0.52/0.62  
% 0.52/0.62  cnf(clause_5,axiom,
% 0.52/0.62      big_f(a) ).
% 0.52/0.62  
% 0.52/0.62  cnf(clause_6,axiom,
% 0.52/0.62      ( ~ big_h(a,X)
% 0.52/0.62      | big_l(X) ) ).
% 0.52/0.62  
% 0.52/0.62  cnf(clause_7,axiom,
% 0.52/0.62      ( ~ big_g(X)
% 0.52/0.62      | ~ big_h(a,X)
% 0.52/0.62      | big_j(a,X) ) ).
% 0.52/0.62  
% 0.52/0.62  cnf(clause_8,negated_conjecture,
% 0.52/0.62      ( ~ big_f(X)
% 0.52/0.62      | big_g(g(X)) ) ).
% 0.52/0.62  
% 0.52/0.62  cnf(clause_9,negated_conjecture,
% 0.52/0.62      ( ~ big_f(X)
% 0.52/0.62      | big_h(X,g(X)) ) ).
% 0.52/0.62  
% 0.52/0.62  %--------------------------------------------------------------------------
% 0.52/0.62  %-------------------------------------------
% 0.52/0.62  % Proof found
% 0.52/0.62  % SZS status Theorem for theBenchmark
% 0.52/0.62  % SZS output start Proof
% 0.52/0.62  %ClaNum:9(EqnAxiom:0)
% 0.52/0.62  %VarNum:32(SingletonVarNum:11)
% 0.52/0.62  %MaxLitNum:5
% 0.52/0.62  %MaxfuncDepth:1
% 0.52/0.62  %SharedTerms:2
% 0.52/0.62  %goalClause: 3 5
% 0.52/0.62  [1]P1(a1)
% 0.52/0.62  [2]~P6(x21)+~P2(x21)
% 0.52/0.62  [4]P6(x41)+~P4(a1,x41)
% 0.52/0.62  [3]~P1(x31)+P3(f2(x31))
% 0.52/0.62  [5]~P1(x51)+P4(x51,f2(x51))
% 0.52/0.62  [6]~P3(x61)+~P4(a1,x61)+P5(a1,x61)
% 0.52/0.62  [7]~P1(x72)+~P3(x71)+~P4(x72,x71)+P2(x71)+P3(f3(x72))
% 0.52/0.62  [8]~P1(x82)+~P3(x81)+~P4(x82,x81)+P2(x81)+P4(x82,f3(x82))
% 0.52/0.62  [9]~P3(x91)+~P4(x92,x91)+P2(x91)+~P1(x92)+~P5(x92,f3(x92))
% 0.52/0.62  %EqnAxiom
% 0.52/0.62  
% 0.52/0.62  %-------------------------------------------
% 0.52/0.62  cnf(10,plain,
% 0.52/0.62     (~P2(x101)+~P4(a1,x101)),
% 0.52/0.62     inference(scs_inference,[],[2,4])).
% 0.52/0.62  cnf(12,plain,
% 0.52/0.62     (~P3(x121)+~P4(a1,x121)+~P5(a1,f3(a1))),
% 0.52/0.62     inference(scs_inference,[],[1,10,9])).
% 0.52/0.62  cnf(13,plain,
% 0.52/0.62     (P6(f2(a1))),
% 0.52/0.62     inference(scs_inference,[],[1,5,4])).
% 0.52/0.62  cnf(14,plain,
% 0.52/0.62     (~P4(a1,f2(a1))+~P5(a1,f3(a1))),
% 0.52/0.62     inference(scs_inference,[],[1,12,3])).
% 0.52/0.62  cnf(15,plain,
% 0.52/0.62     (~P5(a1,f3(a1))),
% 0.52/0.62     inference(scs_inference,[],[1,14,5])).
% 0.52/0.62  cnf(16,plain,
% 0.52/0.62     (~P4(a1,f2(a1))+~P3(f2(a1))+P3(f3(a1))),
% 0.52/0.62     inference(scs_inference,[],[13,1,2,7])).
% 0.52/0.62  cnf(17,plain,
% 0.52/0.62     (~P3(f2(a1))+P3(f3(a1))),
% 0.52/0.62     inference(scs_inference,[],[1,16,5])).
% 0.52/0.62  cnf(18,plain,
% 0.52/0.62     (~P3(f2(a1))+~P4(a1,f3(a1))),
% 0.52/0.62     inference(scs_inference,[],[15,17,6])).
% 0.52/0.62  cnf(19,plain,
% 0.52/0.62     (~P4(a1,f3(a1))),
% 0.52/0.62     inference(scs_inference,[],[1,18,3])).
% 0.52/0.62  cnf(20,plain,
% 0.52/0.62     (P2(x201)+~P4(a1,x201)+~P3(x201)),
% 0.52/0.62     inference(scs_inference,[],[1,19,8])).
% 0.52/0.62  cnf(21,plain,
% 0.52/0.62     (P2(f2(a1))+~P4(a1,f2(a1))),
% 0.52/0.62     inference(scs_inference,[],[1,20,3])).
% 0.52/0.62  cnf(31,plain,
% 0.52/0.62     (P2(f2(a1))),
% 0.52/0.63     inference(scs_inference,[],[1,21,5])).
% 0.52/0.63  cnf(32,plain,
% 0.52/0.63     ($false),
% 0.52/0.63     inference(scs_inference,[],[13,31,2]),
% 0.52/0.63     ['proof']).
% 0.52/0.63  % SZS output end Proof
% 0.52/0.63  % Total time :0.000000s
%------------------------------------------------------------------------------