↑ Up

ConnectPP---0.7.2.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : ConnectPP---0.7.2
% Problem  : LCL414+1 : TPTP v9.3.1. Released v2.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : /export/starexec/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/benchmark/theBenchmark.p

% Computer : n017.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Thu Sep 24 08:49:14 AM UTC 2026

% Result   : Theorem 0.13s 0.39s
% Output   : Proof 0.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   21 (  12 unt;   0 def)
%            Number of atoms       :   63 (   0 equ)
%            Maximal formula atoms :    7 (   3 avg)
%            Number of connectives :   69 (  27   ~;  18   |;  24   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   3 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-1 aty)
%            Number of functors    :    3 (   3 usr;   1 con; 0-2 aty)
%            Number of variables   :   70 (   3 sgn  54   !;   4   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(thm147,conjecture,
    ~ ( ? [A] : ~ a_truth(implies(A,A))
      & ! [P,Q] : a_truth(implies(implies(not(P),not(Q)),implies(Q,P)))
      & ! [P,Q,R] : a_truth(implies(implies(P,implies(Q,R)),implies(implies(P,Q),implies(P,R))))
      & ! [P,Q] : a_truth(implies(P,implies(Q,P)))
      & ! [P,Q] :
          ( a_truth(Q)
          | ~ a_truth(P)
          | ~ a_truth(implies(P,Q)) ) ),
    file('theBenchmark.p',thm147) ).

fof(f_1_1,negated_conjecture,
    ( ? [A] : ~ a_truth(implies(A,A))
    & ! [P,Q] : a_truth(implies(implies(not(P),not(Q)),implies(Q,P)))
    & ! [P,Q,R] : a_truth(implies(implies(P,implies(Q,R)),implies(implies(P,Q),implies(P,R))))
    & ! [P,Q] : a_truth(implies(P,implies(Q,P)))
    & ! [P,Q] :
        ( a_truth(Q)
        | ~ a_truth(P)
        | ~ a_truth(implies(P,Q)) ) ),
    inference(negate,[status(cth)],[thm147]) ).

fof(f_1_2,negated_conjecture,
    ( ? [U_9] : ~ a_truth(implies(U_9,U_9))
    & ! [U_8,U_7] : a_truth(implies(implies(not(U_8),not(U_7)),implies(U_7,U_8)))
    & ! [U_6,U_5,U_4] : a_truth(implies(implies(U_6,implies(U_5,U_4)),implies(implies(U_6,U_5),implies(U_6,U_4))))
    & ! [U_3,U_2] : a_truth(implies(U_3,implies(U_2,U_3)))
    & ! [U_1,U_0] :
        ( a_truth(U_0)
        | ~ a_truth(U_1)
        | ~ a_truth(implies(U_1,U_0)) ) ),
    inference(variable_rename,[status(thm)],[f_1_1]) ).

fof(f_1_3,negated_conjecture,
    ( ? [U_9] : ~ a_truth(implies(U_9,U_9))
    & ! [U_8,U_7] : a_truth(implies(implies(not(U_8),not(U_7)),implies(U_7,U_8)))
    & ! [U_6,U_5,U_4] : a_truth(implies(implies(U_6,implies(U_5,U_4)),implies(implies(U_6,U_5),implies(U_6,U_4))))
    & ! [U_3,U_2] : a_truth(implies(U_3,implies(U_2,U_3)))
    & ! [U_1] :
        ( ! [U_0] :
            ( a_truth(U_0)
            | ~ a_truth(implies(U_1,U_0)) )
        | ~ a_truth(U_1) ) ),
    inference(miniscope,[status(thm)],[f_1_2]) ).

fof(f_1_4,negated_conjecture,
    ( ~ a_truth(implies(sK1,sK1))
    & ! [U_8,U_7] : a_truth(implies(implies(not(U_8),not(U_7)),implies(U_7,U_8)))
    & ! [U_6,U_5,U_4] : a_truth(implies(implies(U_6,implies(U_5,U_4)),implies(implies(U_6,U_5),implies(U_6,U_4))))
    & ! [U_3,U_2] : a_truth(implies(U_3,implies(U_2,U_3)))
    & ! [U_1] :
        ( ! [U_0] :
            ( a_truth(U_0)
            | ~ a_truth(implies(U_1,U_0)) )
        | ~ a_truth(U_1) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(U_9,sK1)],[f_1_3]) ).

fof(f_1_5,negated_conjecture,
    ( ~ a_truth(implies(sK1,sK1))
    & ! [U_7,U_8] : a_truth(implies(implies(not(U_8),not(U_7)),implies(U_7,U_8)))
    & ! [U_4,U_5,U_6] : a_truth(implies(implies(U_6,implies(U_5,U_4)),implies(implies(U_6,U_5),implies(U_6,U_4))))
    & ! [U_3,U_2] : a_truth(implies(U_3,implies(U_2,U_3)))
    & ! [U_0,U_1] :
        ( a_truth(U_0)
        | ~ a_truth(implies(U_1,U_0))
        | ~ a_truth(U_1) ) ),
    inference(definitional_conversion,[status(esa)],[f_1_4]) ).

cnf(f_1_6,negated_conjecture,
    ( a_truth(U_0)
    | ~ a_truth(implies(U_1,U_0))
    | ~ a_truth(U_1) ),
    inference(clausify,[status(thm)],[f_1_5]) ).

cnf(f_1_7,negated_conjecture,
    a_truth(implies(U_3,implies(U_2,U_3))),
    inference(clausify,[status(thm)],[f_1_5]) ).

cnf(f_1_8,negated_conjecture,
    a_truth(implies(implies(U_6,implies(U_5,U_4)),implies(implies(U_6,U_5),implies(U_6,U_4)))),
    inference(clausify,[status(thm)],[f_1_5]) ).

cnf(f_1_10,negated_conjecture,
    ~ a_truth(implies(sK1,sK1)),
    inference(clausify,[status(thm)],[f_1_5]) ).

cnf(t1,plain,
    ~ a_truth(implies(sK1,sK1)),
    inference(start,[status(thm),parent(0:0)],[f_1_10]) ).

cnf(t2,plain,
    ( ~ a_truth(implies(implies(sK1,implies(U_64,sK1)),implies(sK1,sK1)))
    | ~ a_truth(implies(sK1,implies(U_64,sK1)))
    | a_truth(implies(sK1,sK1)) ),
    inference(extension,[status(thm),parent(t1:1)],[f_1_6]) ).

cnf(t3,plain,
    $false,
    inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).

cnf(t4,plain,
    a_truth(implies(sK1,implies(U_64,sK1))),
    inference(extension,[status(thm),parent(t2:2)],[f_1_7]) ).

cnf(t5,plain,
    $false,
    inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).

cnf(t6,plain,
    ( ~ a_truth(implies(implies(sK1,implies(implies(U_64,sK1),sK1)),implies(implies(sK1,implies(U_64,sK1)),implies(sK1,sK1))))
    | ~ a_truth(implies(sK1,implies(implies(U_64,sK1),sK1)))
    | a_truth(implies(implies(sK1,implies(U_64,sK1)),implies(sK1,sK1))) ),
    inference(extension,[status(thm),parent(t2:3)],[f_1_6]) ).

cnf(t7,plain,
    $false,
    inference(connection,[status(thm),parent(t6:1)],[t6:1,t2:3]) ).

cnf(t8,plain,
    a_truth(implies(sK1,implies(implies(U_64,sK1),sK1))),
    inference(extension,[status(thm),parent(t6:2)],[f_1_7]) ).

cnf(t9,plain,
    $false,
    inference(connection,[status(thm),parent(t8:1)],[t8:1,t6:2]) ).

cnf(t10,plain,
    a_truth(implies(implies(sK1,implies(implies(U_64,sK1),sK1)),implies(implies(sK1,implies(U_64,sK1)),implies(sK1,sK1)))),
    inference(extension,[status(thm),parent(t6:3)],[f_1_8]) ).

cnf(t11,plain,
    $false,
    inference(connection,[status(thm),parent(t10:1)],[t10:1,t6:3]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : LCL414+1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.03  This is a FOF_THM_RFO_NEQ problem
% 0.00/0.04  % Command  : /export/starexec/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.36  % Computer : n017.cluster.edu
% 0.08/0.36  % Model    : x86_64 x86_64
% 0.08/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36  % Memory   : 8046.5625MB
% 0.08/0.36  % OS       : Linux 6.8.0-71-generic
% 0.08/0.36  % CPULimit : 300
% 0.08/0.36  % WCLimit  : 300
% 0.08/0.36  % DateTime : Sat Sep 19 14:54:40 UTC 2026
% 0.08/0.36  % CPUTime  : 
% 0.13/0.39  % SZS status Theorem for theBenchmark
% 0.13/0.39  % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------