↑ Up

CSE---1.7.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE---1.7
% Problem  : MSC012+1 : TPTP v8.2.0. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -jar /export/starexec/sandbox2/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 11:52:12 EDT 2024

% Result   : Theorem 1.02s 1.12s
% Output   : CNFRefutation 1.08s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : MSC012+1 : TPTP v8.2.0. Released v3.2.0.
% 0.07/0.12  % Command    : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.12/0.33  % Computer : n029.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   : Sat Jun 22 05:53:24 EDT 2024
% 0.12/0.33  % CPUTime    : 
% 0.48/0.56  start to proof:theBenchmark
% 1.02/1.12  %-------------------------------------------
% 1.02/1.12  % File        :CSE---1.7
% 1.02/1.12  % Problem     :theBenchmark
% 1.02/1.12  % Transform   :cnf
% 1.02/1.12  % Format      :tptp:raw
% 1.02/1.12  % Command     :java -jar mcs_scs.jar %d %s
% 1.02/1.12  
% 1.02/1.12  % Result      :Theorem 0.510000s
% 1.02/1.12  % Output      :CNFRefutation 0.510000s
% 1.02/1.12  %-------------------------------------------
% 1.02/1.12  %------------------------------------------------------------------------------
% 1.02/1.12  % File     : MSC012+1 : TPTP v8.2.0. Released v3.2.0.
% 1.02/1.12  % Domain   : Miscellaneous
% 1.02/1.12  % Problem  : A serial and transitive relation inconsistent for non-empty domain
% 1.02/1.12  % Version  : Especial.
% 1.02/1.12  % English  :
% 1.02/1.12  
% 1.02/1.12  % Refs     : [Bez05] Bezem (2005), Email to Geoff Sutcliffe
% 1.02/1.12  % Source   : [Bez05]
% 1.02/1.12  % Names    : ser [Bez05]
% 1.02/1.12  
% 1.02/1.12  % Status   : Theorem
% 1.02/1.12  % Rating   : 0.00 v6.3.0, 0.08 v6.2.0, 0.00 v6.1.0, 0.04 v6.0.0, 0.25 v5.5.0, 0.12 v5.4.0, 0.09 v5.3.0, 0.17 v5.2.0, 0.07 v5.0.0, 0.10 v4.1.0, 0.11 v4.0.1, 0.16 v4.0.0, 0.15 v3.7.0, 0.33 v3.5.0, 0.12 v3.4.0, 0.08 v3.3.0, 0.00 v3.2.0
% 1.02/1.12  
% 1.02/1.12  % Syntax   : Number of formulae    :    5 (   2 unt;   0 def)
% 1.02/1.12  %            Number of atoms       :   12 (   0 equ)
% 1.02/1.12  %            Maximal formula atoms :    4 (   2 avg)
% 1.02/1.12  %            Number of connectives :    7 (   0   ~;   1   |;   4   &)
% 1.02/1.12  %                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
% 1.02/1.12  %            Maximal formula depth :    6 (   4 avg)
% 1.02/1.12  %            Maximal term depth    :    1 (   1 avg)
% 1.02/1.12  %            Number of predicates  :    3 (   3 usr;   1 prp; 0-2 aty)
% 1.02/1.12  %            Number of functors    :    0 (   0 usr;   0 con; --- aty)
% 1.02/1.12  %            Number of variables   :    9 (   7   !;   2   ?)
% 1.02/1.12  % SPC      : FOF_THM_RFO_NEQ
% 1.02/1.12  
% 1.02/1.12  % Comments :
% 1.02/1.12  %------------------------------------------------------------------------------
% 1.02/1.12  fof(left_to_right,axiom,
% 1.02/1.12      ! [A,B] :
% 1.02/1.12        ( ( p(A)
% 1.02/1.12          & less(A,B)
% 1.02/1.12          & p(B) )
% 1.02/1.12       => goal ) ).
% 1.02/1.12  
% 1.02/1.12  fof(right_to_left,axiom,
% 1.02/1.12      ! [A] :
% 1.02/1.12        ( p(A)
% 1.02/1.12        | ? [B] :
% 1.02/1.12            ( less(A,B)
% 1.02/1.12            & p(B) ) ) ).
% 1.02/1.12  
% 1.02/1.12  fof(transitive_less,axiom,
% 1.02/1.12      ! [A,B,C] :
% 1.02/1.12        ( ( less(A,B)
% 1.02/1.12          & less(B,C) )
% 1.02/1.12       => less(A,C) ) ).
% 1.02/1.12  
% 1.02/1.12  fof(serial_less,axiom,
% 1.02/1.12      ! [A] :
% 1.02/1.12      ? [B] : less(A,B) ).
% 1.02/1.12  
% 1.02/1.12  fof(goal_to_be_proved,conjecture,
% 1.02/1.12      goal ).
% 1.02/1.12  
% 1.02/1.12  %------------------------------------------------------------------------------
% 1.02/1.12  %-------------------------------------------
% 1.02/1.12  % Proof found
% 1.02/1.12  % SZS status Theorem for theBenchmark
% 1.02/1.12  % SZS output start Proof
% 1.02/1.12  %ClaNum:6(EqnAxiom:0)
% 1.02/1.12  %VarNum:17(SingletonVarNum:8)
% 1.02/1.12  %MaxLitNum:4
% 1.02/1.12  %MaxfuncDepth:1
% 1.02/1.12  %SharedTerms:3
% 1.02/1.12  %goalClause: 2
% 1.02/1.12  %singleGoalClaCount:1
% 1.02/1.12  [2]~P2(a5000)
% 1.02/1.12  [1]P1(x11,f1(x11))
% 1.02/1.12  [3]P3(x31)+P3(f2(x31))
% 1.02/1.12  [4]P3(x41)+P1(x41,f2(x41))
% 1.02/1.12  [6]~P1(x61,x63)+P1(x61,x62)+~P1(x63,x62)
% 1.02/1.12  [5]~P1(x52,x51)+~P3(x51)+~P3(x52)+P2(a5000)
% 1.02/1.12  %EqnAxiom
% 1.02/1.12  
% 1.02/1.12  %-------------------------------------------
% 1.08/1.13  cnf(9,plain,
% 1.08/1.13     (~P3(f1(x91))+~P3(x91)),
% 1.08/1.13     inference(scs_inference,[],[2,1,6,5])).
% 1.08/1.13  cnf(11,plain,
% 1.08/1.13     (~P3(x111)+~P3(x112)+~P1(x112,x111)),
% 1.08/1.13     inference(scs_inference,[],[2,5])).
% 1.08/1.13  cnf(23,plain,
% 1.08/1.13     (~P1(f2(x231),f2(x231))+P3(x231)),
% 1.08/1.13     inference(scs_inference,[],[3,11])).
% 1.08/1.13  cnf(39,plain,
% 1.08/1.13     (~P3(x391)+P1(f1(x391),f2(f1(x391)))),
% 1.08/1.13     inference(scs_inference,[],[9,4])).
% 1.08/1.13  cnf(119,plain,
% 1.08/1.13     (~P3(x1191)+P1(x1191,f2(f1(x1191)))),
% 1.08/1.13     inference(scs_inference,[],[1,39,6])).
% 1.08/1.13  cnf(122,plain,
% 1.08/1.13     (~P3(f2(f1(x1221)))+~P3(x1221)),
% 1.08/1.13     inference(scs_inference,[],[119,11])).
% 1.08/1.13  cnf(128,plain,
% 1.08/1.13     (~P3(x1281)+P3(f1(x1281))),
% 1.08/1.13     inference(scs_inference,[],[122,3])).
% 1.08/1.13  cnf(129,plain,
% 1.08/1.13     (~P3(x1291)),
% 1.08/1.13     inference(scs_inference,[],[128,9])).
% 1.08/1.13  cnf(132,plain,
% 1.08/1.13     (P3(x1321)),
% 1.08/1.13     inference(scs_inference,[],[129,23,3])).
% 1.08/1.13  cnf(138,plain,
% 1.08/1.13     ($false),
% 1.08/1.13     inference(scs_inference,[],[129,132]),
% 1.08/1.13     ['proof']).
% 1.08/1.13  % SZS output end Proof
% 1.08/1.13  % Total time :0.510000s
%------------------------------------------------------------------------------