↑ Up

CSE_E---1.7.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : LCL212-3 : TPTP v9.2.1. Released v2.3.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 : n018.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:45 PM UTC 2026

% Result   : Unsatisfiable 1.23s 1.71s
% Output   : CNFRefutation 1.23s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    5
% Syntax   : Number of clauses     :   16 (  10 unt;   0 nHn;   9 RR)
%            Number of literals    :   25 (   2 equ;  12 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    7 (   2 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   2 con; 0-2 aty)
%            Number of variables   :   22 (   5 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(axiom_1_3,axiom,
    axiom(implies(X1,or(X2,X1))),
    file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_3) ).

cnf(implies_definition,axiom,
    implies(X1,X2) = or(not(X1),X2),
    file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',implies_definition) ).

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

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

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

cnf(c_0_5,axiom,
    axiom(implies(X1,or(X2,X1))),
    axiom_1_3 ).

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

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

cnf(c_0_8,axiom,
    ( theorem(X1)
    | ~ axiom(X1) ),
    rule_1 ).

cnf(c_0_9,plain,
    axiom(or(not(X1),or(X2,X1))),
    inference(rw,[status(thm)],[c_0_5,c_0_6]) ).

cnf(c_0_10,negated_conjecture,
    ~ theorem(implies(not(p),implies(q,implies(implies(p,q),q)))),
    prove_this ).

cnf(c_0_11,plain,
    ( theorem(X1)
    | ~ theorem(X2)
    | ~ theorem(or(not(X2),X1)) ),
    inference(rw,[status(thm)],[c_0_7,c_0_6]) ).

cnf(c_0_12,plain,
    theorem(or(not(X1),or(X2,X1))),
    inference(spm,[status(thm)],[c_0_8,c_0_9]) ).

cnf(c_0_13,negated_conjecture,
    ~ theorem(or(not(not(p)),or(not(q),or(not(or(not(p),q)),q)))),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_6]),c_0_6]),c_0_6]),c_0_6]) ).

cnf(c_0_14,plain,
    ( theorem(or(X1,X2))
    | ~ theorem(X2) ),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_15,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_12])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : LCL212-3 : TPTP v9.2.1. Released v2.3.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.13/0.32  % Computer : n018.cluster.edu
% 0.13/0.32  % Model    : x86_64 x86_64
% 0.13/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.32  % Memory   : 8042.1875MB
% 0.13/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.32  % CPULimit   : 300
% 0.13/0.32  % WCLimit    : 300
% 0.13/0.32  % DateTime   : Mon May  4 22:10:17 EDT 2026
% 0.13/0.33  % CPUTime    : 
% 0.13/0.34  % start to proof: theBenchmark
% 1.23/1.71  % Version  : CSE_E---1.7
% 1.23/1.71  % Problem  : theBenchmark.p
% 1.23/1.71  % SZS status Unsatisfiable for theBenchmark.p
% 1.23/1.71  % SZS output start CNFRefutation
% See solution above
% 1.23/1.71  % Total time : 1.371s
%------------------------------------------------------------------------------