↑ Up

CSE_E---1.7.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : LCL231-3 : TPTP v9.2.1. Released v2.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/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:50 PM UTC 2026

% Result   : Unsatisfiable 6.24s 4.50s
% Output   : CNFRefutation 6.24s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   30 (  19 unt;   0 nHn;  12 RR)
%            Number of literals    :   45 (   2 equ;  18 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    :    6 (   6 usr;   3 con; 0-2 aty)
%            Number of variables   :   67 (   4 sgn)

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

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

cnf(axiom_1_5,axiom,
    axiom(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3)))),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_5) ).

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

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

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

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

cnf(c_0_7,axiom,
    axiom(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2)))),
    axiom_1_6 ).

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

cnf(c_0_9,axiom,
    axiom(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3)))),
    axiom_1_5 ).

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

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

cnf(c_0_12,plain,
    axiom(or(not(or(not(X1),X2)),or(not(or(X3,X1)),or(X3,X2)))),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_7,c_0_8]),c_0_8]),c_0_8]) ).

cnf(c_0_13,plain,
    axiom(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3)))),
    inference(rw,[status(thm)],[c_0_9,c_0_8]) ).

cnf(c_0_14,plain,
    ( theorem(X1)
    | ~ theorem(X2)
    | ~ theorem(or(not(X2),X1)) ),
    inference(rw,[status(thm)],[c_0_10,c_0_8]) ).

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

cnf(c_0_16,plain,
    theorem(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3)))),
    inference(spm,[status(thm)],[c_0_11,c_0_13]) ).

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

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

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

cnf(c_0_20,plain,
    theorem(or(not(or(X1,X2)),or(not(or(not(X2),X3)),or(X1,X3)))),
    inference(spm,[status(thm)],[c_0_18,c_0_15]) ).

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

cnf(c_0_22,negated_conjecture,
    ~ theorem(implies(implies(implies(p,q),implies(p,r)),implies(p,implies(q,r)))),
    prove_this ).

cnf(c_0_23,plain,
    ( theorem(or(X1,or(X2,or(X3,X4))))
    | ~ theorem(or(X1,or(X3,or(X2,X4)))) ),
    inference(spm,[status(thm)],[c_0_19,c_0_16]) ).

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

cnf(c_0_25,plain,
    axiom(or(not(X1),or(X2,X1))),
    inference(rw,[status(thm)],[c_0_21,c_0_8]) ).

cnf(c_0_26,negated_conjecture,
    ~ theorem(or(not(or(not(or(not(p),q)),or(not(p),r))),or(not(p),or(not(q),r)))),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]) ).

cnf(c_0_27,plain,
    ( theorem(or(not(or(not(X1),or(X2,X3))),or(X2,or(X4,X3))))
    | ~ theorem(or(X4,X1)) ),
    inference(spm,[status(thm)],[c_0_23,c_0_24]) ).

cnf(c_0_28,plain,
    theorem(or(not(X1),or(X2,X1))),
    inference(spm,[status(thm)],[c_0_11,c_0_25]) ).

cnf(c_0_29,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : LCL231-3 : TPTP v9.2.1. Released v2.3.0.
% 0.00/0.12  % Command    : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.16/0.34  % Computer : n003.cluster.edu
% 0.16/0.34  % Model    : x86_64 x86_64
% 0.16/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.34  % Memory   : 8042.1875MB
% 0.16/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.34  % CPULimit   : 300
% 0.16/0.34  % WCLimit    : 300
% 0.16/0.34  % DateTime   : Mon May  4 22:13:41 EDT 2026
% 0.16/0.34  % CPUTime    : 
% 0.16/0.35  % start to proof: theBenchmark
% 6.24/4.50  % Version  : CSE_E---1.7
% 6.24/4.50  % Problem  : theBenchmark.p
% 6.24/4.50  % SZS status Unsatisfiable for theBenchmark.p
% 6.24/4.50  % SZS output start CNFRefutation
% See solution above
% 6.24/4.52  % Total time : 3.375s
%------------------------------------------------------------------------------