↑ Up

LisaST---0.9.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : LisaST---0.9
% Problem  : REL002+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p

% Computer : n005.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 : Sun Sep 27 08:24:11 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(maddux1_join_commutativity,axiom,
    ! [X0,X1] : join(X0,X1) = join(X1,X0) ).

fof(maddux2_join_associativity,axiom,
    ! [X0,X1,X2] : join(X0,join(X1,X2)) = join(join(X0,X1),X2) ).

fof(maddux3_a_kind_of_de_Morgan,axiom,
    ! [X0,X1] : X0 = join(complement(join(complement(X0),complement(X1))),complement(join(complement(X0),X1))) ).

fof(maddux4_definiton_of_meet,axiom,
    ! [X0,X1] : meet(X0,X1) = complement(join(complement(X0),complement(X1))) ).

fof(def_top,axiom,
    ! [X0] : top = join(X0,complement(X0)) ).

fof(def_zero,axiom,
    ! [X0] : zero = meet(X0,complement(X0)) ).

fof(goals,conjecture,
    ! [X0] : join(X0,top) = top ).

fof(negated_conjecture,negated_conjecture,
    ~ ! [X0] : join(X0,top) = top,
    inference(negate_conjecture,[status(cth)],[goals]) ).

cnf(c0,plain,
    join(X0,X1) = join(X1,X0),
    inference(clausification,[status(esa)],[maddux1_join_commutativity]) ).

cnf(c1,plain,
    join(X0,join(X1,X2)) = join(join(X0,X1),X2),
    inference(clausification,[status(esa)],[maddux2_join_associativity]) ).

cnf(c2,plain,
    X0 = join(complement(join(complement(X0),complement(X1))),complement(join(complement(X0),X1))),
    inference(clausification,[status(esa)],[maddux3_a_kind_of_de_Morgan]) ).

cnf(c3,plain,
    meet(X0,X1) = complement(join(complement(X0),complement(X1))),
    inference(clausification,[status(esa)],[maddux4_definiton_of_meet]) ).

cnf(c11,plain,
    top = join(X0,complement(X0)),
    inference(clausification,[status(esa)],[def_top]) ).

cnf(c12,plain,
    zero = meet(X0,complement(X0)),
    inference(clausification,[status(esa)],[def_zero]) ).

cnf(c13,plain,
    join(sK25,top) != top,
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(d0,plain,
    meet(X0,complement(X0)) = complement(top),
    inference(superposition,[status(thm)],[c11,c3]) ).

cnf(d1,plain,
    zero = complement(top),
    inference(demodulation,[status(thm)],[d0,c12]) ).

cnf(d2,plain,
    top = join(top,zero),
    inference(superposition,[status(thm)],[d1,c11]) ).

cnf(d3,plain,
    join(X0,join(complement(X0),X1)) = join(top,X1),
    inference(superposition,[status(thm)],[c11,c1]) ).

cnf(d4,plain,
    join(X2,join(X0,X1)) = join(X0,join(X1,X2)),
    inference(superposition,[status(thm)],[c1,c0]) ).

cnf(d5,plain,
    X0 = join(complement(join(complement(X0),X1)),complement(join(complement(X0),complement(X1)))),
    inference(demodulation,[status(thm)],[c2,c0]) ).

cnf(d6,plain,
    join(complement(join(complement(X0),X1)),join(complement(join(complement(X0),complement(X1))),X2)) = join(X0,X2),
    inference(superposition,[status(thm)],[d5,c1]) ).

cnf(d7,plain,
    join(complement(join(complement(X0),X1)),join(meet(X0,X1),X2)) = join(X0,X2),
    inference(demodulation,[status(thm)],[d6,c3]) ).

cnf(d8,plain,
    join(meet(X0,X1),join(X2,complement(join(complement(X0),X1)))) = join(X0,X2),
    inference(demodulation,[status(thm)],[d7,d4]) ).

cnf(d9,plain,
    join(meet(X0,X1),top) = join(X0,join(complement(X0),X1)),
    inference(superposition,[status(thm)],[c11,d8]) ).

cnf(d10,plain,
    join(top,meet(X0,X1)) = join(X0,join(complement(X0),X1)),
    inference(demodulation,[status(thm)],[d9,c0]) ).

cnf(d11,plain,
    join(top,meet(X0,X1)) = join(top,X1),
    inference(demodulation,[status(thm)],[d10,d3]) ).

cnf(d12,plain,
    join(top,zero) = join(top,complement(X0)),
    inference(superposition,[status(thm)],[c12,d11]) ).

cnf(d13,plain,
    top = join(top,complement(X0)),
    inference(demodulation,[status(thm)],[d12,d2]) ).

cnf(d14,plain,
    join(X0,top) = join(top,complement(complement(X0))),
    inference(superposition,[status(thm)],[c11,d3]) ).

cnf(d15,plain,
    join(X0,top) = top,
    inference(demodulation,[status(thm)],[d14,d13]) ).

cnf(d16,plain,
    top = join(top,X0),
    inference(superposition,[status(thm)],[d15,c0]) ).

cnf(d17,plain,
    join(top,sK25) != top,
    inference(demodulation,[status(thm)],[c13,c0]) ).

cnf(d18,plain,
    top != top,
    inference(demodulation,[status(thm)],[d17,d16]) ).

cnf(d19,plain,
    join(top,join(zero,X0)) = join(top,X0),
    inference(superposition,[status(thm)],[d2,c1]) ).

cnf(d20,plain,
    join(X0,join(X1,complement(join(X0,X1)))) = top,
    inference(superposition,[status(thm)],[c11,c1]) ).

cnf(d21,plain,
    top = join(top,complement(join(top,zero))),
    inference(superposition,[status(thm)],[d20,d19]) ).

cnf(d22,plain,
    top = join(top,complement(top)),
    inference(demodulation,[status(thm)],[d21,d2]) ).

cnf(d23,plain,
    top = top,
    inference(demodulation,[status(thm)],[d22,c11]) ).

cnf(d24,plain,
    $false,
    inference(resolution,[status(thm)],[d23,d18]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : REL002+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.37  % Computer : n005.cluster.edu
% 0.10/0.37  % Model    : x86_64 x86_64
% 0.10/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37  % Memory   : 8046.5625MB
% 0.10/0.37  % OS       : Linux 6.8.0-71-generic
% 0.10/0.37  % CPULimit : 300
% 0.10/0.37  % WCLimit  : 300
% 0.10/0.37  % DateTime : Sat Sep 26 05:24:47 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.37  Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 28.67/4.09  % SZS status Theorem for theBenchmark.p
% 28.67/4.09  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------