TSTP Solution File: SYN002-1.007.008 by CSE---1.6

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CSE---1.6
% Problem  : SYN002-1.007.008 : TPTP v8.1.2. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %s %d

% Computer : n006.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:43:39 EDT 2023

% Result   : Unsatisfiable 0.20s 0.67s
% Output   : CNFRefutation 0.20s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem    : SYN002-1.007.008 : TPTP v8.1.2. Released v1.0.0.
% 0.11/0.13  % Command    : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %s %d
% 0.14/0.34  % Computer : n006.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit   : 300
% 0.14/0.34  % WCLimit    : 300
% 0.14/0.34  % DateTime   : Sat Aug 26 19:33:22 EDT 2023
% 0.14/0.34  % CPUTime    : 
% 0.20/0.58  start to proof:theBenchmark
% 0.20/0.66  %-------------------------------------------
% 0.20/0.66  % File        :CSE---1.6
% 0.20/0.66  % Problem     :theBenchmark
% 0.20/0.66  % Transform   :cnf
% 0.20/0.66  % Format      :tptp:raw
% 0.20/0.66  % Command     :java -jar mcs_scs.jar %d %s
% 0.20/0.66  
% 0.20/0.66  % Result      :Theorem 0.040000s
% 0.20/0.66  % Output      :CNFRefutation 0.040000s
% 0.20/0.66  %-------------------------------------------
% 0.20/0.67  %--------------------------------------------------------------------------
% 0.20/0.67  % File     : SYN002-1.007.008 : TPTP v8.1.2. Released v1.0.0.
% 0.20/0.67  % Domain   : Syntactic
% 0.20/0.67  % Problem  : Odd and Even Problem
% 0.20/0.67  % Version  : Especial.
% 0.20/0.67  % English  : Given by the clauses C1: p(X) v p(f^M(X)) and C2: ~p(X)
% 0.20/0.67  %            v ~p(f^N(X)), where if M is odd N is even and vice versa,
% 0.20/0.67  %            N > M. The sizes are used for N and M.
% 0.20/0.67  
% 0.20/0.67  % Refs     : [Soc92] Socher-Ambrosius (1992), How to Avoid the Derivation o
% 0.20/0.67  % Source   : [Soc92]
% 0.20/0.67  % Names    : ederX-Y.lop (Size X:Y) [TUM]
% 0.20/0.67  
% 0.20/0.67  % Status   : Unsatisfiable
% 0.20/0.67  % Rating   : 0.00 v6.3.0, 0.14 v6.2.0, 0.00 v3.1.0, 0.17 v2.7.0, 0.12 v2.6.0, 0.00 v2.1.0
% 0.20/0.67  % Syntax   : Number of clauses     :    2 (   0 unt;   1 nHn;   1 RR)
% 0.20/0.67  %            Number of literals    :    4 (   0 equ;   2 neg)
% 0.20/0.67  %            Maximal clause size   :    2 (   2 avg)
% 0.20/0.67  %            Maximal term depth    :    9 (   4 avg)
% 0.20/0.67  %            Number of predicates  :    1 (   1 usr;   0 prp; 1-1 aty)
% 0.20/0.67  %            Number of functors    :    1 (   1 usr;   0 con; 1-1 aty)
% 0.20/0.67  %            Number of variables   :    2 (   0 sgn)
% 0.20/0.67  % SPC      : CNF_UNS_RFO_NEQ_NHN
% 0.20/0.67  
% 0.20/0.67  % Comments :
% 0.20/0.67  %          : tptp2X: -f tptp -s7:8 SYN002-1.g
% 0.20/0.67  %--------------------------------------------------------------------------
% 0.20/0.67  cnf(positive,negated_conjecture,
% 0.20/0.67      ( p(X)
% 0.20/0.67      | p(f(f(f(f(f(f(f(X)))))))) ) ).
% 0.20/0.67  
% 0.20/0.67  cnf(negative,negated_conjecture,
% 0.20/0.67      ( ~ p(X)
% 0.20/0.67      | ~ p(f(f(f(f(f(f(f(f(X))))))))) ) ).
% 0.20/0.67  
% 0.20/0.67  %--------------------------------------------------------------------------
% 0.20/0.67  %-------------------------------------------
% 0.20/0.67  % Proof found
% 0.20/0.67  % SZS status Theorem for theBenchmark
% 0.20/0.67  % SZS output start Proof
% 0.20/0.67  %ClaNum:2(EqnAxiom:0)
% 0.20/0.67  %VarNum:4(SingletonVarNum:2)
% 0.20/0.67  %MaxLitNum:2
% 0.20/0.67  %MaxfuncDepth:8
% 0.20/0.67  %SharedTerms:0
% 0.20/0.67  %goalClause: 1 2
% 0.20/0.67  [1]P1(x11)+P1(f1(f1(f1(f1(f1(f1(f1(x11))))))))
% 0.20/0.67  [2]~P1(x21)+~P1(f1(f1(f1(f1(f1(f1(f1(f1(x21)))))))))
% 0.20/0.67  %EqnAxiom
% 0.20/0.67  
% 0.20/0.67  %-------------------------------------------
% 0.20/0.67  cnf(5,plain,
% 0.20/0.67     (P1(f1(x51))+~P1(x51)),
% 0.20/0.67     inference(scs_inference,[],[1,2])).
% 0.20/0.67  cnf(7,plain,
% 0.20/0.67     (~P1(f1(f1(f1(f1(f1(f1(f1(x71))))))))+~P1(x71)),
% 0.20/0.67     inference(scs_inference,[],[5,2])).
% 0.20/0.67  cnf(11,plain,
% 0.20/0.67     (P1(f1(f1(f1(f1(f1(f1(f1(f1(x111)))))))))+P1(x111)),
% 0.20/0.67     inference(scs_inference,[],[5,1])).
% 0.20/0.67  cnf(13,plain,
% 0.20/0.67     (~P1(f1(x131))+P1(x131)),
% 0.20/0.67     inference(scs_inference,[],[7,11])).
% 0.20/0.67  cnf(14,plain,
% 0.20/0.67     (~P1(f1(x141))+~P1(f1(f1(f1(f1(f1(f1(f1(x141))))))))),
% 0.20/0.67     inference(scs_inference,[],[13,7])).
% 0.20/0.67  cnf(16,plain,
% 0.20/0.67     (P1(f1(f1(f1(f1(f1(f1(x161)))))))+P1(x161)),
% 0.20/0.67     inference(scs_inference,[],[13,1])).
% 0.20/0.67  cnf(17,plain,
% 0.20/0.67     (P1(f1(f1(f1(f1(f1(f1(x171)))))))+~P1(f1(f1(f1(f1(f1(f1(f1(f1(x171)))))))))),
% 0.20/0.67     inference(scs_inference,[],[16,2])).
% 0.20/0.67  cnf(21,plain,
% 0.20/0.67     (P1(f1(f1(f1(f1(f1(x211))))))+~P1(f1(f1(f1(f1(f1(f1(f1(f1(x211)))))))))),
% 0.20/0.67     inference(scs_inference,[],[13,17])).
% 0.20/0.67  cnf(24,plain,
% 0.20/0.68     (P1(f1(f1(x241)))+~P1(x241)),
% 0.20/0.68     inference(scs_inference,[],[16,2])).
% 0.20/0.68  cnf(25,plain,
% 0.20/0.68     (P1(f1(f1(x251)))+P1(f1(f1(f1(f1(f1(f1(f1(x251))))))))),
% 0.20/0.68     inference(scs_inference,[],[24,1])).
% 0.20/0.68  cnf(26,plain,
% 0.20/0.68     (P1(f1(f1(f1(f1(f1(f1(f1(x261))))))))+P1(f1(f1(f1(x261))))),
% 0.20/0.68     inference(scs_inference,[],[25,5])).
% 0.20/0.68  cnf(27,plain,
% 0.20/0.68     (~P1(x271)+P1(f1(f1(f1(x271))))),
% 0.20/0.68     inference(scs_inference,[],[26,7])).
% 0.20/0.68  cnf(28,plain,
% 0.20/0.68     (~P1(f1(f1(f1(f1(x281)))))+~P1(f1(x281))),
% 0.20/0.68     inference(scs_inference,[],[27,14])).
% 0.20/0.68  cnf(29,plain,
% 0.20/0.68     (P1(x291)+~P1(f1(f1(f1(f1(f1(x291))))))),
% 0.20/0.68     inference(scs_inference,[],[28,11])).
% 0.20/0.68  cnf(30,plain,
% 0.20/0.68     (P1(x301)+~P1(f1(f1(f1(f1(f1(f1(x301)))))))),
% 0.20/0.68     inference(scs_inference,[],[29,13])).
% 0.20/0.68  cnf(31,plain,
% 0.20/0.68     (P1(x311)+~P1(f1(f1(f1(f1(f1(f1(f1(f1(x311)))))))))),
% 0.20/0.68     inference(scs_inference,[],[30,17])).
% 0.20/0.68  cnf(32,plain,
% 0.20/0.68     (P1(x321)+P1(f1(x321))),
% 0.20/0.68     inference(scs_inference,[],[31,1])).
% 0.20/0.68  cnf(33,plain,
% 0.20/0.68     (P1(f1(f1(f1(f1(f1(f1(f1(x331))))))))+P1(f1(f1(f1(f1(f1(x331))))))),
% 0.20/0.68     inference(scs_inference,[],[32,21])).
% 0.20/0.68  cnf(34,plain,
% 0.20/0.68     (P1(f1(f1(f1(f1(f1(f1(x341)))))))+~P1(x341)),
% 0.20/0.68     inference(scs_inference,[],[33,2])).
% 0.20/0.68  cnf(35,plain,
% 0.20/0.68     (~P1(x351)+P1(f1(f1(f1(f1(f1(f1(f1(x351))))))))),
% 0.20/0.68     inference(scs_inference,[],[34,5])).
% 0.20/0.68  cnf(36,plain,
% 0.20/0.68     (~P1(x361)),
% 0.20/0.68     inference(scs_inference,[],[35,7])).
% 0.20/0.68  cnf(38,plain,
% 0.20/0.68     (~P1(x381)),
% 0.20/0.68     inference(rename_variables,[],[36])).
% 0.20/0.68  cnf(39,plain,
% 0.20/0.68     (P1(x391)),
% 0.20/0.68     inference(scs_inference,[],[36,38,33,32])).
% 0.20/0.68  cnf(41,plain,
% 0.20/0.68     ($false),
% 0.20/0.68     inference(scs_inference,[],[36,39]),
% 0.20/0.68     ['proof']).
% 0.20/0.68  % SZS output end Proof
% 0.20/0.68  % Total time :0.040000s
%------------------------------------------------------------------------------