↑ Up

LisaST---0.9.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : LisaST---0.9
% Problem  : LCL154-1 : TPTP v9.3.1. Released v1.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 07:53:52 AM UTC 2026

% Result   : Unsatisfiable 21.45s 4.78s
% Output   : CNFRefutation 21.45s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   22
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   68 (  68 unt;   0 nHn;   9 RR)
%            Number of literals    :   68 (  67 equ;   3 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   3 con; 0-2 aty)
%            Number of variables   :   78 (   5 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(prove_alternative_wajsberg_axiom,negated_conjecture,
    xor(x,falsehood) != x ).

cnf(wajsberg_1,axiom,
    implies(truth,X0) = X0 ).

cnf(wajsberg_2,axiom,
    implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2))) = truth ).

cnf(wajsberg_3,axiom,
    implies(implies(X0,X1),X1) = implies(implies(X1,X0),X0) ).

cnf(wajsberg_4,axiom,
    implies(implies(not(X0),not(X1)),implies(X1,X0)) = truth ).

cnf(or_definition,axiom,
    or(X0,X1) = implies(not(X0),X1) ).

cnf(or_commutativity,axiom,
    or(X0,X1) = or(X1,X0) ).

cnf(and_definition,axiom,
    and(X0,X1) = not(or(not(X0),not(X1))) ).

cnf(xor_definition,axiom,
    xor(X0,X1) = or(and(X0,not(X1)),and(not(X0),X1)) ).

cnf(false_definition,axiom,
    not(truth) = falsehood ).

cnf(c0,plain,
    xor(x,falsehood) != x,
    inference(clausification,[status(esa)],[prove_alternative_wajsberg_axiom]) ).

cnf(c1,plain,
    implies(truth,X0) = X0,
    inference(clausification,[status(esa)],[wajsberg_1]) ).

cnf(c2,plain,
    implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2))) = truth,
    inference(clausification,[status(esa)],[wajsberg_2]) ).

cnf(c3,plain,
    implies(implies(X0,X1),X1) = implies(implies(X1,X0),X0),
    inference(clausification,[status(esa)],[wajsberg_3]) ).

cnf(c4,plain,
    implies(implies(not(X0),not(X1)),implies(X1,X0)) = truth,
    inference(clausification,[status(esa)],[wajsberg_4]) ).

cnf(c5,plain,
    implies(not(X0),X1) = or(X0,X1),
    inference(clausification,[status(esa)],[or_definition]) ).

cnf(c7,plain,
    or(X0,X1) = or(X1,X0),
    inference(clausification,[status(esa)],[or_commutativity]) ).

cnf(c8,plain,
    not(or(not(X0),not(X1))) = and(X0,X1),
    inference(clausification,[status(esa)],[and_definition]) ).

cnf(c11,plain,
    or(and(X0,not(X1)),and(not(X0),X1)) = xor(X0,X1),
    inference(clausification,[status(esa)],[xor_definition]) ).

cnf(c16,plain,
    not(truth) = falsehood,
    inference(clausification,[status(esa)],[false_definition]) ).

cnf(d0,plain,
    implies(or(X0,not(X1)),implies(X1,X0)) = truth,
    inference(demodulation,[status(thm)],[c4,c5]) ).

cnf(d1,plain,
    implies(or(X0,not(truth)),X0) = truth,
    inference(superposition,[status(thm)],[c1,d0]) ).

cnf(d2,plain,
    implies(or(X0,falsehood),X0) = truth,
    inference(demodulation,[status(thm)],[d1,c16]) ).

cnf(d3,plain,
    implies(or(falsehood,X0),X0) = truth,
    inference(superposition,[status(thm)],[c7,d2]) ).

cnf(d4,plain,
    implies(X0,implies(implies(X0,X1),implies(truth,X1))) = truth,
    inference(superposition,[status(thm)],[c1,c2]) ).

cnf(d5,plain,
    implies(X1,implies(implies(X1,X0),X0)) = truth,
    inference(demodulation,[status(thm)],[d4,c1]) ).

cnf(d6,plain,
    truth = implies(implies(truth,X0),X0),
    inference(superposition,[status(thm)],[d5,c1]) ).

cnf(d7,plain,
    truth = implies(X0,X0),
    inference(demodulation,[status(thm)],[d6,c1]) ).

cnf(d8,plain,
    truth = or(X0,not(X0)),
    inference(superposition,[status(thm)],[d7,c5]) ).

cnf(d9,plain,
    implies(truth,not(falsehood)) = truth,
    inference(superposition,[status(thm)],[d8,d3]) ).

cnf(d10,plain,
    not(falsehood) = truth,
    inference(demodulation,[status(thm)],[d9,c1]) ).

cnf(d11,plain,
    implies(truth,X0) = or(falsehood,X0),
    inference(superposition,[status(thm)],[d10,c5]) ).

cnf(d12,plain,
    X0 = or(falsehood,X0),
    inference(demodulation,[status(thm)],[d11,c1]) ).

cnf(d13,plain,
    or(X0,falsehood) = X0,
    inference(superposition,[status(thm)],[d12,c7]) ).

cnf(d14,plain,
    implies(implies(X0,truth),truth) = implies(X0,X0),
    inference(superposition,[status(thm)],[c1,c3]) ).

cnf(d15,plain,
    implies(X0,implies(X0,X0)) = truth,
    inference(superposition,[status(thm)],[d14,d5]) ).

cnf(d16,plain,
    implies(X0,truth) = truth,
    inference(demodulation,[status(thm)],[d15,d7]) ).

cnf(d17,plain,
    truth = or(X0,truth),
    inference(superposition,[status(thm)],[d16,c5]) ).

cnf(d18,plain,
    implies(falsehood,X0) = or(truth,X0),
    inference(superposition,[status(thm)],[c16,c5]) ).

cnf(d19,plain,
    or(X0,truth) = implies(falsehood,X0),
    inference(superposition,[status(thm)],[d18,c7]) ).

cnf(d20,plain,
    truth = implies(falsehood,X0),
    inference(demodulation,[status(thm)],[d19,d17]) ).

cnf(d21,plain,
    implies(implies(X0,falsehood),falsehood) = implies(truth,X0),
    inference(superposition,[status(thm)],[d20,c3]) ).

cnf(d22,plain,
    implies(implies(X0,falsehood),falsehood) = X0,
    inference(demodulation,[status(thm)],[d21,c1]) ).

cnf(d23,plain,
    implies(or(X0,falsehood),falsehood) = not(X0),
    inference(superposition,[status(thm)],[c5,d22]) ).

cnf(d24,plain,
    implies(X0,falsehood) = not(X0),
    inference(demodulation,[status(thm)],[d23,d13]) ).

cnf(d25,plain,
    not(implies(X0,falsehood)) = X0,
    inference(demodulation,[status(thm)],[d22,d24]) ).

cnf(d26,plain,
    not(not(X0)) = X0,
    inference(demodulation,[status(thm)],[d25,d24]) ).

cnf(d27,plain,
    not(or(not(X0),truth)) = and(X0,falsehood),
    inference(superposition,[status(thm)],[d10,c8]) ).

cnf(d28,plain,
    not(truth) = and(X0,falsehood),
    inference(demodulation,[status(thm)],[d27,d17]) ).

cnf(d29,plain,
    falsehood = and(X0,falsehood),
    inference(demodulation,[status(thm)],[d28,c16]) ).

cnf(d30,plain,
    not(or(not(X0),falsehood)) = and(X0,truth),
    inference(superposition,[status(thm)],[c16,c8]) ).

cnf(d31,plain,
    not(or(falsehood,not(X0))) = and(X0,truth),
    inference(demodulation,[status(thm)],[d30,c7]) ).

cnf(d32,plain,
    not(not(X0)) = and(X0,truth),
    inference(demodulation,[status(thm)],[d31,d12]) ).

cnf(d33,plain,
    not(or(falsehood,not(X0))) = and(truth,X0),
    inference(superposition,[status(thm)],[c16,c8]) ).

cnf(d34,plain,
    not(not(X0)) = and(truth,X0),
    inference(demodulation,[status(thm)],[d33,d12]) ).

cnf(d35,plain,
    not(or(falsehood,falsehood)) = and(truth,truth),
    inference(superposition,[status(thm)],[c16,d33]) ).

cnf(d36,plain,
    or(and(X0,and(truth,truth)),and(not(X0),or(falsehood,falsehood))) = xor(X0,or(falsehood,falsehood)),
    inference(superposition,[status(thm)],[d35,c11]) ).

cnf(d37,plain,
    or(and(X0,not(not(truth))),and(not(X0),or(falsehood,falsehood))) = xor(X0,or(falsehood,falsehood)),
    inference(demodulation,[status(thm)],[d36,d34]) ).

cnf(d38,plain,
    or(and(X0,not(falsehood)),and(not(X0),or(falsehood,falsehood))) = xor(X0,or(falsehood,falsehood)),
    inference(demodulation,[status(thm)],[d37,c16]) ).

cnf(d39,plain,
    or(and(X0,truth),and(not(X0),or(falsehood,falsehood))) = xor(X0,or(falsehood,falsehood)),
    inference(demodulation,[status(thm)],[d38,d10]) ).

cnf(d40,plain,
    or(not(not(X0)),and(not(X0),or(falsehood,falsehood))) = xor(X0,or(falsehood,falsehood)),
    inference(demodulation,[status(thm)],[d39,d32]) ).

cnf(d41,plain,
    or(not(not(X0)),and(not(X0),falsehood)) = xor(X0,or(falsehood,falsehood)),
    inference(demodulation,[status(thm)],[d40,d12]) ).

cnf(d42,plain,
    or(not(not(X0)),falsehood) = xor(X0,or(falsehood,falsehood)),
    inference(demodulation,[status(thm)],[d41,d29]) ).

cnf(d43,plain,
    not(not(X0)) = xor(X0,or(falsehood,falsehood)),
    inference(demodulation,[status(thm)],[d42,d13]) ).

cnf(d44,plain,
    not(not(X0)) = xor(X0,falsehood),
    inference(demodulation,[status(thm)],[d43,d12]) ).

cnf(d45,plain,
    X0 = xor(X0,falsehood),
    inference(demodulation,[status(thm)],[d44,d26]) ).

cnf(d46,plain,
    x != x,
    inference(demodulation,[status(thm)],[c0,d45]) ).

cnf(d47,plain,
    $false,
    inference(equality_resolution,[status(thm)],[d46]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL154-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.38  % Computer : n005.cluster.edu
% 0.10/0.38  % Model    : x86_64 x86_64
% 0.10/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38  % Memory   : 8046.5625MB
% 0.10/0.38  % OS       : Linux 6.8.0-71-generic
% 0.10/0.38  % CPULimit : 300
% 0.10/0.38  % WCLimit  : 300
% 0.10/0.38  % DateTime : Fri Sep 25 21:56:03 UTC 2026
% 0.10/0.38  % CPUTime  : 
% 0.10/0.38  Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 21.45/4.78  % SZS status Unsatisfiable for theBenchmark.p
% 21.45/4.78  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------