↑ Up

LisaST---0.9.UNS-CRf.s

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

% Computer : n001.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:54:13 AM UTC 2026

% Result   : Unsatisfiable 11.27s 44.94s
% Output   : CNFRefutation 11.27s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   14
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   61 (  41 unt;   0 nHn;  20 RR)
%            Number of literals    :   85 (   6 equ;  27 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   3 con; 0-2 aty)
%            Number of variables   :  135 (  11 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(prove_this,negated_conjecture,
    ~ theorem(implies(implies(p,r),implies(and(p,q),r))) ).

cnf(axiom_1_2,axiom,
    axiom(implies(or(X0,X0),X0)) ).

cnf(axiom_1_3,axiom,
    axiom(implies(X0,or(X1,X0))) ).

cnf(axiom_1_4,axiom,
    axiom(implies(or(X0,X1),or(X1,X0))) ).

cnf(axiom_1_5,axiom,
    axiom(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))) ).

cnf(axiom_1_6,axiom,
    axiom(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))) ).

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

cnf(rule_1,axiom,
    ( ~ axiom(X0)
    | theorem(X0) ) ).

cnf(rule_2,axiom,
    ( ~ theorem(X1)
    | ~ theorem(implies(X1,X0))
    | theorem(X0) ) ).

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

cnf(c0,plain,
    ~ theorem(implies(implies(p,r),implies(and(p,q),r))),
    inference(clausification,[status(esa)],[prove_this]) ).

cnf(c1,plain,
    axiom(implies(or(X0,X0),X0)),
    inference(clausification,[status(esa)],[axiom_1_2]) ).

cnf(c2,plain,
    axiom(implies(X0,or(X1,X0))),
    inference(clausification,[status(esa)],[axiom_1_3]) ).

cnf(c3,plain,
    axiom(implies(or(X0,X1),or(X1,X0))),
    inference(clausification,[status(esa)],[axiom_1_4]) ).

cnf(c4,plain,
    axiom(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))),
    inference(clausification,[status(esa)],[axiom_1_5]) ).

cnf(c5,plain,
    axiom(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))),
    inference(clausification,[status(esa)],[axiom_1_6]) ).

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

cnf(c7,plain,
    ( ~ axiom(X0)
    | theorem(X0) ),
    inference(clausification,[status(esa)],[rule_1]) ).

cnf(c8,plain,
    ( ~ theorem(X0)
    | theorem(X1)
    | ~ theorem(implies(X0,X1)) ),
    inference(clausification,[status(esa)],[rule_2]) ).

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

cnf(d0,plain,
    theorem(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))),
    inference(resolution,[status(thm)],[c5,c7]) ).

cnf(d1,plain,
    theorem(implies(implies(X1,X2),implies(implies(X0,X1),or(not(X0),X2)))),
    inference(superposition,[status(thm)],[c6,d0]) ).

cnf(d2,plain,
    theorem(implies(implies(X2,X1),implies(implies(X0,X2),implies(X0,X1)))),
    inference(demodulation,[status(thm)],[d1,c6]) ).

cnf(d3,plain,
    theorem(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))),
    inference(resolution,[status(thm)],[c4,c7]) ).

cnf(d4,plain,
    ( ~ theorem(or(X1,or(X0,X2)))
    | theorem(or(X0,or(X1,X2))) ),
    inference(resolution,[status(thm)],[d3,c8]) ).

cnf(d5,plain,
    ( theorem(or(X1,or(not(X0),X2)))
    | ~ theorem(implies(X0,or(X1,X2))) ),
    inference(superposition,[status(thm)],[c6,d4]) ).

cnf(d6,plain,
    ( theorem(or(X2,implies(X0,X1)))
    | ~ theorem(implies(X0,or(X2,X1))) ),
    inference(demodulation,[status(thm)],[d5,c6]) ).

cnf(d7,plain,
    ( theorem(or(not(X0),implies(X2,X1)))
    | ~ theorem(implies(X2,implies(X0,X1))) ),
    inference(superposition,[status(thm)],[c6,d6]) ).

cnf(d8,plain,
    ( theorem(implies(X0,implies(X1,X2)))
    | ~ theorem(implies(X1,implies(X0,X2))) ),
    inference(demodulation,[status(thm)],[d7,c6]) ).

cnf(d9,plain,
    theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2)))),
    inference(resolution,[status(thm)],[d8,d2]) ).

cnf(d10,plain,
    ( ~ theorem(implies(X2,X0))
    | theorem(implies(implies(X0,X1),implies(X2,X1))) ),
    inference(resolution,[status(thm)],[d9,c8]) ).

cnf(d11,plain,
    ~ theorem(implies(and(p,q),p)),
    inference(resolution,[status(thm)],[d10,c0]) ).

cnf(d12,plain,
    theorem(implies(or(X0,X1),or(X1,X0))),
    inference(resolution,[status(thm)],[c3,c7]) ).

cnf(d13,plain,
    theorem(implies(or(X1,not(X0)),implies(X0,X1))),
    inference(superposition,[status(thm)],[c6,d12]) ).

cnf(d14,plain,
    ( ~ theorem(or(X1,not(X0)))
    | theorem(implies(X0,X1)) ),
    inference(resolution,[status(thm)],[d13,c8]) ).

cnf(d15,plain,
    not(implies(X0,not(X1))) = and(X0,X1),
    inference(demodulation,[status(thm)],[c9,c6]) ).

cnf(d16,plain,
    or(and(X0,X1),X2) = implies(implies(X0,not(X1)),X2),
    inference(superposition,[status(thm)],[d15,c6]) ).

cnf(d17,plain,
    theorem(implies(implies(X0,X1),or(X1,not(X0)))),
    inference(superposition,[status(thm)],[c6,d12]) ).

cnf(d18,plain,
    theorem(or(and(X0,X1),or(not(X1),not(X0)))),
    inference(superposition,[status(thm)],[d16,d17]) ).

cnf(d19,plain,
    theorem(or(and(X1,X0),implies(X0,not(X1)))),
    inference(demodulation,[status(thm)],[d18,c6]) ).

cnf(d20,plain,
    ( ~ theorem(implies(X1,X2))
    | theorem(implies(or(X0,X1),or(X0,X2))) ),
    inference(resolution,[status(thm)],[d0,c8]) ).

cnf(d21,plain,
    ( ~ theorem(or(X2,X0))
    | theorem(or(X2,X1))
    | ~ theorem(implies(X0,X1)) ),
    inference(resolution,[status(thm)],[d20,c8]) ).

cnf(d22,plain,
    ( theorem(or(and(X1,X0),X2))
    | ~ theorem(implies(implies(X0,not(X1)),X2)) ),
    inference(resolution,[status(thm)],[d21,d19]) ).

cnf(d23,plain,
    ( theorem(or(and(X1,X0),X2))
    | ~ theorem(or(and(X0,X1),X2)) ),
    inference(demodulation,[status(thm)],[d22,d16]) ).

cnf(d24,plain,
    theorem(implies(or(X0,X0),X0)),
    inference(resolution,[status(thm)],[c1,c7]) ).

cnf(d25,plain,
    ( ~ theorem(or(X0,X0))
    | theorem(X0) ),
    inference(resolution,[status(thm)],[d24,c8]) ).

cnf(d26,plain,
    theorem(implies(X0,or(X1,X0))),
    inference(resolution,[status(thm)],[c2,c7]) ).

cnf(d27,plain,
    theorem(or(X0,implies(X1,X1))),
    inference(resolution,[status(thm)],[d6,d26]) ).

cnf(d28,plain,
    ( theorem(or(X2,X1))
    | ~ theorem(implies(implies(X0,X0),X1)) ),
    inference(resolution,[status(thm)],[d27,d21]) ).

cnf(d29,plain,
    theorem(or(X0,or(X1,not(X1)))),
    inference(resolution,[status(thm)],[d28,d17]) ).

cnf(d30,plain,
    theorem(or(X0,not(X0))),
    inference(resolution,[status(thm)],[d29,d25]) ).

cnf(d31,plain,
    theorem(or(and(X0,X1),not(and(X1,X0)))),
    inference(resolution,[status(thm)],[d30,d23]) ).

cnf(d32,plain,
    theorem(implies(or(and(X0,X1),X2),implies(or(X3,implies(X0,not(X1))),or(X3,X2)))),
    inference(superposition,[status(thm)],[d16,d0]) ).

cnf(d33,plain,
    ( ~ theorem(or(and(X1,X2),X3))
    | theorem(implies(or(X0,implies(X1,not(X2))),or(X0,X3))) ),
    inference(resolution,[status(thm)],[d32,c8]) ).

cnf(d34,plain,
    ( ~ theorem(or(X3,implies(X0,not(X1))))
    | theorem(or(X3,X2))
    | ~ theorem(or(and(X0,X1),X2)) ),
    inference(resolution,[status(thm)],[d33,c8]) ).

cnf(d35,plain,
    theorem(or(X0,or(X1,not(X0)))),
    inference(resolution,[status(thm)],[d29,d4]) ).

cnf(d36,plain,
    theorem(or(X1,implies(X0,not(X1)))),
    inference(superposition,[status(thm)],[c6,d35]) ).

cnf(d37,plain,
    ( ~ theorem(or(and(X2,X0),X1))
    | theorem(or(X0,X1)) ),
    inference(resolution,[status(thm)],[d36,d34]) ).

cnf(d38,plain,
    theorem(or(X0,not(and(X0,X1)))),
    inference(resolution,[status(thm)],[d37,d31]) ).

cnf(d39,plain,
    theorem(implies(and(X0,X1),X0)),
    inference(resolution,[status(thm)],[d38,d14]) ).

cnf(d40,plain,
    $false,
    inference(resolution,[status(thm)],[d39,d11]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04  % Problem  : LCL249-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.06  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/5.45  % Computer : n001.cluster.edu
% 0.18/5.45  % Model    : x86_64 x86_64
% 0.18/5.45  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/5.45  % Memory   : 8046.5625MB
% 0.18/5.45  % OS       : Linux 6.8.0-71-generic
% 0.18/5.45  % CPULimit : 300
% 0.18/5.45  % WCLimit  : 300
% 0.18/5.45  % DateTime : Fri Sep 25 22:13:01 UTC 2026
% 0.18/5.45  % CPUTime  : 
% 0.18/5.45  Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 11.27/44.94  % SZS status Unsatisfiable for theBenchmark.p
% 11.27/44.94  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------