↑ Up

LisaST---0.9.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : LisaST---0.9
% Problem  : PLA017-10 : TPTP v9.3.1. Released v7.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p

% Computer : n018.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:20:06 AM UTC 2026

% Result   : Unsatisfiable 49.93s 15.30s
% Output   : CNFRefutation 49.93s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :   11
% Syntax   : Number of clauses     :   39 (  39 unt;   0 nHn;  25 RR)
%            Number of literals    :   39 (  38 equ;   2 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    7 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :   15 (  15 usr;   6 con; 0-4 aty)
%            Number of variables   :   32 (   4 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(ifeq_axiom,axiom,
    ifeq(X0,X0,X1,X2) = X1 ).

cnf(pickup_1,axiom,
    ifeq(differ(X0,table),true,ifeq(holds(empty,X1),true,ifeq(holds(clear(X0),X1),true,holds(holding(X0),do(pickup(X0),X1)),true),true),true) = true ).

cnf(pickup_4,axiom,
    ifeq(differ(X0,X1),true,ifeq(holds(clear(X0),X2),true,holds(clear(X0),do(pickup(X1),X2)),true),true) = true ).

cnf(putdown_2,axiom,
    ifeq(holds(holding(X0),X1),true,ifeq(holds(clear(X2),X1),true,holds(on(X0,X2),do(putdown(X0,X2),X1)),true),true) = true ).

cnf(symmetry_of_differ,axiom,
    ifeq(differ(X0,X1),true,differ(X1,X0),true) = true ).

cnf(differ_a_c,axiom,
    differ(a,c) = true ).

cnf(differ_a_table,axiom,
    differ(a,table) = true ).

cnf(initial_state5,axiom,
    holds(clear(a),s0) = true ).

cnf(initial_state7,axiom,
    holds(clear(c),s0) = true ).

cnf(initial_state8,axiom,
    holds(empty,s0) = true ).

cnf(prove_AC,negated_conjecture,
    holds(on(a,c),X0) != true ).

cnf(c0,plain,
    ifeq(X0,X0,X1,X2) = X1,
    inference(clausification,[status(esa)],[ifeq_axiom]) ).

cnf(c2,plain,
    ifeq(differ(X0,table),true,ifeq(holds(empty,X1),true,ifeq(holds(clear(X0),X1),true,holds(holding(X0),do(pickup(X0),X1)),true),true),true) = true,
    inference(clausification,[status(esa)],[pickup_1]) ).

cnf(c5,plain,
    ifeq(differ(X0,X1),true,ifeq(holds(clear(X0),X2),true,holds(clear(X0),do(pickup(X1),X2)),true),true) = true,
    inference(clausification,[status(esa)],[pickup_4]) ).

cnf(c7,plain,
    ifeq(holds(holding(X0),X1),true,ifeq(holds(clear(X2),X1),true,holds(on(X0,X2),do(putdown(X0,X2),X1)),true),true) = true,
    inference(clausification,[status(esa)],[putdown_2]) ).

cnf(c11,plain,
    ifeq(differ(X0,X1),true,differ(X1,X0),true) = true,
    inference(clausification,[status(esa)],[symmetry_of_differ]) ).

cnf(c13,plain,
    differ(a,c) = true,
    inference(clausification,[status(esa)],[differ_a_c]) ).

cnf(c15,plain,
    differ(a,table) = true,
    inference(clausification,[status(esa)],[differ_a_table]) ).

cnf(c26,plain,
    holds(clear(a),s0) = true,
    inference(clausification,[status(esa)],[initial_state5]) ).

cnf(c28,plain,
    holds(clear(c),s0) = true,
    inference(clausification,[status(esa)],[initial_state7]) ).

cnf(c29,plain,
    holds(empty,s0) = true,
    inference(clausification,[status(esa)],[initial_state8]) ).

cnf(c31,plain,
    holds(on(a,c),X0) != true,
    inference(clausification,[status(esa)],[prove_AC]) ).

cnf(d0,plain,
    ifeq(differ(a,table),true,ifeq(holds(empty,s0),true,ifeq(true,true,holds(holding(a),do(pickup(a),s0)),true),true),true) = true,
    inference(superposition,[status(thm)],[c26,c2]) ).

cnf(d1,plain,
    ifeq(true,true,ifeq(holds(empty,s0),true,ifeq(true,true,holds(holding(a),do(pickup(a),s0)),true),true),true) = true,
    inference(demodulation,[status(thm)],[d0,c15]) ).

cnf(d2,plain,
    ifeq(holds(empty,s0),true,ifeq(true,true,holds(holding(a),do(pickup(a),s0)),true),true) = true,
    inference(demodulation,[status(thm)],[d1,c0]) ).

cnf(d3,plain,
    ifeq(true,true,ifeq(true,true,holds(holding(a),do(pickup(a),s0)),true),true) = true,
    inference(demodulation,[status(thm)],[d2,c29]) ).

cnf(d4,plain,
    ifeq(true,true,holds(holding(a),do(pickup(a),s0)),true) = true,
    inference(demodulation,[status(thm)],[d3,c0]) ).

cnf(d5,plain,
    holds(holding(a),do(pickup(a),s0)) = true,
    inference(demodulation,[status(thm)],[d4,c0]) ).

cnf(d6,plain,
    ifeq(true,true,ifeq(holds(clear(X0),do(pickup(a),s0)),true,holds(on(a,X0),do(putdown(a,X0),do(pickup(a),s0))),true),true) = true,
    inference(superposition,[status(thm)],[d5,c7]) ).

cnf(d7,plain,
    ifeq(holds(clear(X0),do(pickup(a),s0)),true,holds(on(a,X0),do(putdown(a,X0),do(pickup(a),s0))),true) = true,
    inference(demodulation,[status(thm)],[d6,c0]) ).

cnf(d8,plain,
    ifeq(differ(c,X0),true,ifeq(true,true,holds(clear(c),do(pickup(X0),s0)),true),true) = true,
    inference(superposition,[status(thm)],[c28,c5]) ).

cnf(d9,plain,
    ifeq(differ(c,X0),true,holds(clear(c),do(pickup(X0),s0)),true) = true,
    inference(demodulation,[status(thm)],[d8,c0]) ).

cnf(d10,plain,
    ifeq(true,true,differ(c,a),true) = true,
    inference(superposition,[status(thm)],[c13,c11]) ).

cnf(d11,plain,
    differ(c,a) = true,
    inference(demodulation,[status(thm)],[d10,c0]) ).

cnf(d12,plain,
    ifeq(true,true,holds(clear(c),do(pickup(a),s0)),true) = true,
    inference(superposition,[status(thm)],[d11,d9]) ).

cnf(d13,plain,
    holds(clear(c),do(pickup(a),s0)) = true,
    inference(demodulation,[status(thm)],[d12,c0]) ).

cnf(d14,plain,
    ifeq(true,true,holds(on(a,c),do(putdown(a,c),do(pickup(a),s0))),true) = true,
    inference(superposition,[status(thm)],[d13,d7]) ).

cnf(d15,plain,
    holds(on(a,c),do(putdown(a,c),do(pickup(a),s0))) = true,
    inference(demodulation,[status(thm)],[d14,c0]) ).

cnf(d16,plain,
    $false,
    inference(resolution,[status(thm)],[c31,d15]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : PLA017-10 : TPTP v9.3.1. Released v7.3.0.
% 0.00/0.06  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.17/5.44  % Computer : n018.cluster.edu
% 0.17/5.44  % Model    : x86_64 x86_64
% 0.17/5.44  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/5.44  % Memory   : 8046.5625MB
% 0.17/5.44  % OS       : Linux 6.8.0-71-generic
% 0.17/5.44  % CPULimit : 300
% 0.17/5.44  % WCLimit  : 300
% 0.17/5.44  % DateTime : Sat Sep 26 04:46:26 UTC 2026
% 0.17/5.44  % CPUTime  : 
% 0.17/5.44  Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 49.93/15.30  % SZS status Unsatisfiable for theBenchmark.p
% 49.93/15.30  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------