↑ Up

LisaST---0.9.UNS-CRf.s

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

% Computer : n013.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 07:47:45 AM UTC 2026

% Result   : Unsatisfiable 14.21s 2.28s
% Output   : CNFRefutation 14.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    6
% Syntax   : Number of clauses     :   18 (  18 unt;   0 nHn;   3 RR)
%            Number of literals    :   18 (  17 equ;   2 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    4 (   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   :   25 (   2 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(invertability1,axiom,
    join(complement(X0),X0) = n1 ).

cnf(invertability3,axiom,
    complement(complement(X0)) = X0 ).

cnf(modular_law,axiom,
    join(X0,meet(X1,join(X0,X2))) = meet(join(X0,X1),join(X0,X2)) ).

cnf(prove_orthomodular_law,negated_conjecture,
    join(a,meet(complement(a),join(a,b))) != join(a,b) ).

cnf(absorption1,axiom,
    meet(X0,join(X0,X1)) = X0 ).

cnf(commutativity_of_meet,axiom,
    meet(X0,X1) = meet(X1,X0) ).

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

cnf(c4,plain,
    complement(complement(X0)) = X0,
    inference(clausification,[status(esa)],[invertability3]) ).

cnf(c5,plain,
    join(X0,meet(X1,join(X0,X2))) = meet(join(X0,X1),join(X0,X2)),
    inference(clausification,[status(esa)],[modular_law]) ).

cnf(c6,plain,
    join(a,meet(complement(a),join(a,b))) != join(a,b),
    inference(clausification,[status(esa)],[prove_orthomodular_law]) ).

cnf(c9,plain,
    meet(X0,join(X0,X1)) = X0,
    inference(clausification,[status(esa)],[absorption1]) ).

cnf(c11,plain,
    meet(X0,X1) = meet(X1,X0),
    inference(clausification,[status(esa)],[commutativity_of_meet]) ).

cnf(d0,plain,
    join(X0,complement(X0)) = n1,
    inference(superposition,[status(thm)],[c4,c2]) ).

cnf(d1,plain,
    meet(X0,n1) = X0,
    inference(superposition,[status(thm)],[d0,c9]) ).

cnf(d2,plain,
    meet(n1,X0) = X0,
    inference(superposition,[status(thm)],[c11,d1]) ).

cnf(d3,plain,
    join(X0,meet(complement(X0),join(X0,X1))) = meet(n1,join(X0,X1)),
    inference(superposition,[status(thm)],[d0,c5]) ).

cnf(d4,plain,
    join(X0,meet(complement(X0),join(X0,X1))) = join(X0,X1),
    inference(demodulation,[status(thm)],[d3,d2]) ).

cnf(d5,plain,
    $false,
    inference(resolution,[status(thm)],[d4,c6]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LAT045-1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.04  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.37  % Computer : n013.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 : Fri Sep 25 19:58:36 UTC 2026
% 0.10/0.38  % CPUTime  : 
% 0.10/0.38  Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 14.21/2.28  % SZS status Unsatisfiable for theBenchmark.p
% 14.21/2.28  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------