↑ Up

CSE_E---1.7.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : SYN166-1 : TPTP v9.2.1. Released v1.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d

% Computer : n026.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Tue May  5 05:36:19 PM UTC 2026

% Result   : Unsatisfiable 1.36s 1.73s
% Output   : CNFRefutation 1.36s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   21 (  14 unt;   0 nHn;  15 RR)
%            Number of literals    :   32 (   0 equ;  13 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-3 aty)
%            Number of functors    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :   13 (   6 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(rule_088,axiom,
    ( p1(a,a,a)
    | ~ l0(a) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_088) ).

cnf(axiom_20,axiom,
    l0(a),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_20) ).

cnf(rule_087,axiom,
    ( p1(a,b,a)
    | ~ r0(b)
    | ~ p1(a,a,a) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_087) ).

cnf(axiom_9,axiom,
    r0(b),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_9) ).

cnf(rule_082,axiom,
    ( p1(X1,X2,X3)
    | ~ m0(X3,X1,X4)
    | ~ p1(X3,X1,X4) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_082) ).

cnf(axiom_12,axiom,
    m0(a,X1,a),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_12) ).

cnf(prove_this,negated_conjecture,
    ~ p1(a,b,b),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).

cnf(axiom_38,axiom,
    m0(b,a,a),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_38) ).

cnf(c_0_8,axiom,
    ( p1(a,a,a)
    | ~ l0(a) ),
    rule_088 ).

cnf(c_0_9,axiom,
    l0(a),
    axiom_20 ).

cnf(c_0_10,axiom,
    ( p1(a,b,a)
    | ~ r0(b)
    | ~ p1(a,a,a) ),
    rule_087 ).

cnf(c_0_11,axiom,
    r0(b),
    axiom_9 ).

cnf(c_0_12,plain,
    p1(a,a,a),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_9])]) ).

cnf(c_0_13,axiom,
    ( p1(X1,X2,X3)
    | ~ m0(X3,X1,X4)
    | ~ p1(X3,X1,X4) ),
    rule_082 ).

cnf(c_0_14,plain,
    p1(a,b,a),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_11]),c_0_12])]) ).

cnf(c_0_15,axiom,
    m0(a,X1,a),
    axiom_12 ).

cnf(c_0_16,plain,
    p1(b,X1,a),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15])]) ).

cnf(c_0_17,negated_conjecture,
    ~ p1(a,b,b),
    prove_this ).

cnf(c_0_18,plain,
    ( p1(X1,X2,b)
    | ~ m0(b,X1,a) ),
    inference(spm,[status(thm)],[c_0_13,c_0_16]) ).

cnf(c_0_19,axiom,
    m0(b,a,a),
    axiom_38 ).

cnf(c_0_20,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SYN166-1 : TPTP v9.2.1. Released v1.1.0.
% 0.00/0.12  % Command    : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.14/0.32  % Computer : n026.cluster.edu
% 0.14/0.32  % Model    : x86_64 x86_64
% 0.14/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.32  % Memory   : 8042.1875MB
% 0.14/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.32  % CPULimit   : 300
% 0.14/0.32  % WCLimit    : 300
% 0.14/0.32  % DateTime   : Tue May  5 08:18:38 EDT 2026
% 0.14/0.33  % CPUTime    : 
% 0.14/0.34  % start to proof: theBenchmark
% 1.36/1.73  % Version  : CSE_E---1.7
% 1.36/1.73  % Problem  : theBenchmark.p
% 1.36/1.73  % SZS status Unsatisfiable for theBenchmark.p
% 1.36/1.73  % SZS output start CNFRefutation
% See solution above
% 1.36/1.73  % Total time : 1.374s
%------------------------------------------------------------------------------