↑ Up

CSE_E---1.7.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : SWV366+1 : TPTP v9.2.1. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d

% Computer : n007.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 : Tue May  5 05:22:01 PM UTC 2026

% Result   : Theorem 1.44s 1.77s
% Output   : CNFRefutation 1.44s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   11 (   8 unt;   0 def)
%            Number of atoms       :   14 (  13 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :    6 (   3   ~;   0   |;   1   &)
%                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   4 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :   12 (  12 usr;   7 con; 0-3 aty)
%            Number of variables   :   58 (  16 sgn  36   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(l2_co,conjecture,
    ! [X1] :
      ( ! [X2,X3,X4,X5] : i(triple(X2,X1,X4)) = i(triple(X3,X1,X5))
     => ! [X6,X7,X8,X9,X10,X11] : i(triple(X6,insert_slb(X1,pair(X10,X11)),X8)) = i(triple(X7,insert_slb(X1,pair(X10,X11)),X9)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',l2_co) ).

fof(ax55,axiom,
    ! [X1,X2,X3,X4,X5] : i(triple(X1,insert_slb(X2,pair(X4,X5)),X3)) = insert_pq(i(triple(X1,X2,X3)),X4),
    file('/export/starexec/sandbox/benchmark/Axioms/SWV007+4.ax',ax55) ).

fof(c_0_2,negated_conjecture,
    ~ ! [X1] :
        ( ! [X2,X3,X4,X5] : i(triple(X2,X1,X4)) = i(triple(X3,X1,X5))
       => ! [X6,X7,X8,X9,X10,X11] : i(triple(X6,insert_slb(X1,pair(X10,X11)),X8)) = i(triple(X7,insert_slb(X1,pair(X10,X11)),X9)) ),
    inference(assume_negation,[status(cth)],[l2_co]) ).

fof(c_0_3,plain,
    ! [X329,X330,X331,X332,X333] : i(triple(X329,insert_slb(X330,pair(X332,X333)),X331)) = insert_pq(i(triple(X329,X330,X331)),X332),
    inference(variable_rename,[status(thm)],[ax55]) ).

fof(c_0_4,negated_conjecture,
    ! [X355,X356,X357,X358] :
      ( i(triple(X355,esk5_0,X357)) = i(triple(X356,esk5_0,X358))
      & i(triple(esk6_0,insert_slb(esk5_0,pair(esk10_0,esk11_0)),esk8_0)) != i(triple(esk7_0,insert_slb(esk5_0,pair(esk10_0,esk11_0)),esk9_0)) ),
    inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])]) ).

cnf(c_0_5,plain,
    i(triple(X1,insert_slb(X2,pair(X3,X4)),X5)) = insert_pq(i(triple(X1,X2,X5)),X3),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

cnf(c_0_6,negated_conjecture,
    i(triple(X1,esk5_0,X2)) = i(triple(X3,esk5_0,X4)),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_7,negated_conjecture,
    i(triple(X1,insert_slb(esk5_0,pair(X2,X3)),X4)) = insert_pq(i(triple(X5,esk5_0,X6)),X2),
    inference(spm,[status(thm)],[c_0_5,c_0_6]) ).

cnf(c_0_8,negated_conjecture,
    i(triple(esk6_0,insert_slb(esk5_0,pair(esk10_0,esk11_0)),esk8_0)) != i(triple(esk7_0,insert_slb(esk5_0,pair(esk10_0,esk11_0)),esk9_0)),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_9,negated_conjecture,
    i(triple(X1,insert_slb(esk5_0,pair(X2,X3)),X4)) = i(triple(X5,insert_slb(esk5_0,pair(X2,X6)),X7)),
    inference(spm,[status(thm)],[c_0_5,c_0_7]) ).

cnf(c_0_10,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[c_0_8,c_0_9]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SWV366+1 : TPTP v9.2.1. Released v3.3.0.
% 0.00/0.12  % Command    : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.15/0.33  % Computer : n007.cluster.edu
% 0.15/0.33  % Model    : x86_64 x86_64
% 0.15/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.33  % Memory   : 8042.1875MB
% 0.15/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.33  % CPULimit   : 300
% 0.15/0.33  % WCLimit    : 300
% 0.15/0.33  % DateTime   : Tue May  5 05:05:09 EDT 2026
% 0.15/0.33  % CPUTime    : 
% 0.15/0.34  % start to proof: theBenchmark
% 1.44/1.77  % Version  : CSE_E---1.7
% 1.44/1.77  % Problem  : theBenchmark.p
% 1.44/1.77  % SZS status Theorem for theBenchmark.p
% 1.44/1.77  % SZS output start CNFRefutation
% See solution above
% 1.44/1.77  % Total time : 1.373s
%------------------------------------------------------------------------------