↑ Up

CSE_E---1.7.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : LCL170-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 : n024.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 04:39:34 PM UTC 2026

% Result   : Unsatisfiable 0.11s 1.51s
% Output   : CNFRefutation 0.11s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    2
%            Number of leaves      :    9
% Syntax   : Number of clauses     :   19 (  13 unt;   0 nHn;   9 RR)
%            Number of literals    :   29 (   0 equ;  12 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-1 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :   34 (   2 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(axiom_1_6,axiom,
    axiom(or(not(or(not(X1),X2)),or(not(or(X3,X1)),or(X3,X2)))),
    file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',axiom_1_6) ).

cnf(axiom_1_5,axiom,
    axiom(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3)))),
    file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',axiom_1_5) ).

cnf(axiom_1_4,axiom,
    axiom(or(not(or(X1,X2)),or(X2,X1))),
    file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',axiom_1_4) ).

cnf(rule_3,axiom,
    ( theorem(or(not(X1),X2))
    | ~ axiom(or(not(X1),X3))
    | ~ theorem(or(not(X3),X2)) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',rule_3) ).

cnf(prove_this,negated_conjecture,
    ~ theorem(or(not(q),or(not(p),q))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).

cnf(axiom_1_2,axiom,
    axiom(or(not(or(X1,X1)),X1)),
    file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',axiom_1_2) ).

cnf(axiom_1_3,axiom,
    axiom(or(not(X1),or(X2,X1))),
    file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',axiom_1_3) ).

cnf(rule_2,axiom,
    ( theorem(X1)
    | ~ axiom(or(not(X2),X1))
    | ~ theorem(X2) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',rule_2) ).

cnf(rule_1,axiom,
    ( theorem(X1)
    | ~ axiom(X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',rule_1) ).

cnf(i_0_9,axiom,
    axiom(or(not(or(not(X1),X2)),or(not(or(X3,X1)),or(X3,X2)))),
    axiom_1_6,
    [final] ).

cnf(i_0_10,axiom,
    axiom(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3)))),
    axiom_1_5,
    [final] ).

cnf(i_0_11,axiom,
    axiom(or(not(or(X1,X2)),or(X2,X1))),
    axiom_1_4,
    [final] ).

cnf(i_0_12,axiom,
    ( theorem(or(not(X1),X2))
    | ~ axiom(or(not(X1),X3))
    | ~ theorem(or(not(X3),X2)) ),
    rule_3,
    [final] ).

cnf(i_0_13,negated_conjecture,
    ~ theorem(or(not(q),or(not(p),q))),
    prove_this,
    [final] ).

cnf(i_0_14,axiom,
    axiom(or(not(or(X1,X1)),X1)),
    axiom_1_2,
    [final] ).

cnf(i_0_15,axiom,
    axiom(or(not(X1),or(X2,X1))),
    axiom_1_3,
    [final] ).

cnf(i_0_16,axiom,
    ( theorem(X1)
    | ~ axiom(or(not(X2),X1))
    | ~ theorem(X2) ),
    rule_2,
    [final] ).

cnf(i_0_17,axiom,
    ( theorem(X1)
    | ~ axiom(X1) ),
    rule_1,
    [final] ).

cnf(i_0_18,plain,
    $false,
    inference(scs_inference,[],[i_0_13,i_0_15,i_0_17]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.06  % Problem    : LCL170-1 : TPTP v9.2.1. Released v1.1.0.
% 0.00/0.06  % 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.07/0.24  % Computer : n024.cluster.edu
% 0.07/0.24  % Model    : x86_64 x86_64
% 0.07/0.24  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.24  % Memory   : 8042.1875MB
% 0.07/0.24  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.07/0.24  % CPULimit   : 300
% 0.07/0.24  % WCLimit    : 300
% 0.07/0.24  % DateTime   : Mon May  4 17:06:26 EDT 2026
% 0.07/0.25  % CPUTime    : 
% 0.07/0.25  % start to proof: theBenchmark
% 0.11/1.51  % Version  : CSE_E---1.7
% 0.11/1.51  % Problem  : theBenchmark.p
% 0.11/1.51  % SZS status Unsatisfiable for theBenchmark.p
% 0.11/1.51  % SZS output start CNFRefutation
% See solution above
% 0.11/1.52  % Total time : 1.261s
%------------------------------------------------------------------------------