↑ Up

CSE_E---1.7.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : LCL197-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 : n003.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:41 PM UTC 2026

% Result   : Unsatisfiable 1.25s 1.72s
% Output   : CNFRefutation 1.25s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   19 (  11 unt;   0 nHn;  12 RR)
%            Number of literals    :   31 (   0 equ;  17 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   :   30 (   0 sgn)

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

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(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(rule_2,axiom,
    ( theorem(X1)
    | ~ axiom(or(not(X2),X1))
    | ~ theorem(X2) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',rule_2) ).

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(rule_1,axiom,
    ( theorem(X1)
    | ~ axiom(X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',rule_1) ).

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(c_0_7,negated_conjecture,
    ~ theorem(or(not(or(q,or(p,q))),or(p,q))),
    prove_this ).

cnf(c_0_8,axiom,
    ( theorem(or(not(X1),X2))
    | ~ axiom(or(not(X1),X3))
    | ~ theorem(or(not(X3),X2)) ),
    rule_3 ).

cnf(c_0_9,negated_conjecture,
    ( ~ theorem(or(not(X1),or(p,q)))
    | ~ axiom(or(not(or(q,or(p,q))),X1)) ),
    inference(spm,[status(thm)],[c_0_7,c_0_8]) ).

cnf(c_0_10,axiom,
    axiom(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3)))),
    axiom_1_5 ).

cnf(c_0_11,axiom,
    ( theorem(X1)
    | ~ axiom(or(not(X2),X1))
    | ~ theorem(X2) ),
    rule_2 ).

cnf(c_0_12,axiom,
    axiom(or(not(or(not(X1),X2)),or(not(or(X3,X1)),or(X3,X2)))),
    axiom_1_6 ).

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

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

cnf(c_0_15,negated_conjecture,
    ~ theorem(or(not(or(q,q)),q)),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

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

cnf(c_0_17,axiom,
    axiom(or(not(or(X1,X1)),X1)),
    axiom_1_2 ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : LCL197-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.15/0.33  % Computer : n003.cluster.edu
% 0.15/0.33  % Model    : x86_64 x86_64
% 0.15/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.33  % Memory   : 8042.1875MB
% 0.15/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.33  % CPULimit   : 300
% 0.15/0.33  % WCLimit    : 300
% 0.15/0.33  % DateTime   : Mon May  4 22:08:26 EDT 2026
% 0.15/0.34  % CPUTime    : 
% 0.15/0.35  % start to proof: theBenchmark
% 1.25/1.72  % Version  : CSE_E---1.7
% 1.25/1.72  % Problem  : theBenchmark.p
% 1.25/1.72  % SZS status Unsatisfiable for theBenchmark.p
% 1.25/1.72  % SZS output start CNFRefutation
% See solution above
% 1.25/1.72  % Total time : 1.372s
%------------------------------------------------------------------------------