↑ Up

LisaST---0.9.UNS-CRf.s

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

% Computer : n020.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:00:12 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
cnf(clause_1,axiom,
    tt = f(t,t) ).

cnf(clause_3,axiom,
    ts = f(t,s) ).

cnf(clause_4,axiom,
    'tt$uts' = f(tt,ts) ).

cnf(clause_7,axiom,
    tk = f(t,k) ).

cnf(clause_9,axiom,
    tsk = f(ts,k) ).

cnf(prove_equation,negated_conjecture,
    f(t,tsk) != f('tt$uts',tk) ).

cnf(a1,axiom,
    f(X0,f(X1,X2)) = f(f(X0,X1),f(X0,X2)) ).

cnf(c_0,plain,
    tt = f(t,t),
    inference(clausification,[status(esa)],[clause_1]) ).

cnf(c_2,plain,
    ts = f(t,s),
    inference(clausification,[status(esa)],[clause_3]) ).

cnf(c_3,plain,
    'tt$uts' = f(tt,ts),
    inference(clausification,[status(esa)],[clause_4]) ).

cnf(c_6,plain,
    tk = f(t,k),
    inference(clausification,[status(esa)],[clause_7]) ).

cnf(c_8,plain,
    tsk = f(ts,k),
    inference(clausification,[status(esa)],[clause_9]) ).

cnf(c_10,plain,
    f(t,tsk) != f('tt$uts',tk),
    inference(clausification,[status(esa)],[prove_equation]) ).

cnf(c_11,plain,
    f(X0,f(X1,X2)) = f(f(X0,X1),f(X0,X2)),
    inference(clausification,[status(esa)],[a1]) ).

cnf(d0,plain,
    f(t,f(X0,k)) = f(f(t,X0),tk),
    inference(superposition,[status(thm)],[c_6,c_11]) ).

cnf(d1,plain,
    f(t,f(t,X0)) = f(tt,f(t,X0)),
    inference(superposition,[status(thm)],[c_0,c_11]) ).

cnf(d2,plain,
    f(t,f(t,s)) = f(tt,ts),
    inference(superposition,[status(thm)],[c_2,d1]) ).

cnf(d3,plain,
    f(t,ts) = f(tt,ts),
    inference(demodulation,[status(thm)],[d2,c_2]) ).

cnf(d4,plain,
    f(t,ts) = 'tt$uts',
    inference(demodulation,[status(thm)],[d3,c_3]) ).

cnf(d5,plain,
    f(t,f(ts,k)) = f('tt$uts',tk),
    inference(superposition,[status(thm)],[d4,d0]) ).

cnf(d6,plain,
    f(t,tsk) = f('tt$uts',tk),
    inference(demodulation,[status(thm)],[d5,c_8]) ).

cnf(d7,plain,
    $false,
    inference(resolution,[status(thm)],[c_10,d6]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LDA007-1 : TPTP v9.3.1. Bugfixed v2.6.0.
% 0.00/0.04  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/5.38  % Computer : n020.cluster.edu
% 0.10/5.38  % Model    : x86_64 x86_64
% 0.10/5.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.38  % Memory   : 8046.5625MB
% 0.10/5.38  % OS       : Linux 6.8.0-71-generic
% 0.10/5.38  % CPULimit : 300
% 0.10/5.38  % WCLimit  : 300
% 0.10/5.38  % DateTime : Fri Sep 25 23:57:09 UTC 2026
% 0.10/5.38  % CPUTime  : 
% 0.10/5.38  Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 14.59/7.84  % SZS status Unsatisfiable for theBenchmark.p
% 14.59/7.84  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------