↑ Up

CSE_E---1.7.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : LCL041-1 : TPTP v9.2.1. Released v1.0.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:14 PM UTC 2026

% Result   : Unsatisfiable 1.37s 1.74s
% Output   : CNFRefutation 1.37s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   30 (  17 unt;   0 nHn;  15 RR)
%            Number of literals    :   48 (   0 equ;  23 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-1 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :   55 (   5 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(condensed_detachment,axiom,
    ( is_a_theorem(X2)
    | ~ is_a_theorem(implies(X1,X2))
    | ~ is_a_theorem(X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',condensed_detachment) ).

cnf(cn_54,axiom,
    is_a_theorem(implies(implies(X1,X2),implies(implies(not(X1),X2),X2))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_54) ).

cnf(cn_18,axiom,
    is_a_theorem(implies(X1,implies(X2,X1))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_18) ).

cnf(cn_3,axiom,
    is_a_theorem(implies(X1,implies(not(X1),X2))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_3) ).

cnf(cn_21,axiom,
    is_a_theorem(implies(implies(X1,implies(X2,X3)),implies(X2,implies(X1,X3)))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_21) ).

cnf(cn_22,axiom,
    is_a_theorem(implies(implies(X1,X2),implies(implies(X3,X1),implies(X3,X2)))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_22) ).

cnf(prove_cn_30,negated_conjecture,
    ~ is_a_theorem(implies(implies(a,implies(a,b)),implies(a,b))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_cn_30) ).

cnf(c_0_7,axiom,
    ( is_a_theorem(X2)
    | ~ is_a_theorem(implies(X1,X2))
    | ~ is_a_theorem(X1) ),
    condensed_detachment ).

cnf(c_0_8,axiom,
    is_a_theorem(implies(implies(X1,X2),implies(implies(not(X1),X2),X2))),
    cn_54 ).

cnf(c_0_9,plain,
    ( is_a_theorem(implies(implies(not(X1),X2),X2))
    | ~ is_a_theorem(implies(X1,X2)) ),
    inference(spm,[status(thm)],[c_0_7,c_0_8]) ).

cnf(c_0_10,plain,
    ( is_a_theorem(X1)
    | ~ is_a_theorem(implies(not(X2),X1))
    | ~ is_a_theorem(implies(X2,X1)) ),
    inference(spm,[status(thm)],[c_0_7,c_0_9]) ).

cnf(c_0_11,axiom,
    is_a_theorem(implies(X1,implies(X2,X1))),
    cn_18 ).

cnf(c_0_12,plain,
    ( is_a_theorem(implies(X1,X2))
    | ~ is_a_theorem(implies(not(X2),implies(X1,X2))) ),
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_13,axiom,
    is_a_theorem(implies(X1,implies(not(X1),X2))),
    cn_3 ).

cnf(c_0_14,axiom,
    is_a_theorem(implies(implies(X1,implies(X2,X3)),implies(X2,implies(X1,X3)))),
    cn_21 ).

cnf(c_0_15,axiom,
    is_a_theorem(implies(implies(X1,X2),implies(implies(X3,X1),implies(X3,X2)))),
    cn_22 ).

cnf(c_0_16,plain,
    is_a_theorem(implies(not(not(X1)),X1)),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_17,plain,
    ( is_a_theorem(implies(X1,implies(X2,X3)))
    | ~ is_a_theorem(implies(X2,implies(X1,X3))) ),
    inference(spm,[status(thm)],[c_0_7,c_0_14]) ).

cnf(c_0_18,plain,
    ( is_a_theorem(implies(implies(X1,X2),implies(X1,X3)))
    | ~ is_a_theorem(implies(X2,X3)) ),
    inference(spm,[status(thm)],[c_0_7,c_0_15]) ).

cnf(c_0_19,plain,
    ( is_a_theorem(X1)
    | ~ is_a_theorem(implies(not(not(not(X1))),X1)) ),
    inference(spm,[status(thm)],[c_0_10,c_0_16]) ).

cnf(c_0_20,plain,
    is_a_theorem(implies(X1,implies(X2,X2))),
    inference(spm,[status(thm)],[c_0_17,c_0_11]) ).

cnf(c_0_21,negated_conjecture,
    ~ is_a_theorem(implies(implies(a,implies(a,b)),implies(a,b))),
    prove_cn_30 ).

cnf(c_0_22,plain,
    ( is_a_theorem(implies(X1,X2))
    | ~ is_a_theorem(implies(X1,X3))
    | ~ is_a_theorem(implies(X3,X2)) ),
    inference(spm,[status(thm)],[c_0_7,c_0_18]) ).

cnf(c_0_23,plain,
    ( is_a_theorem(implies(X1,X2))
    | ~ is_a_theorem(implies(X1,implies(X3,X2)))
    | ~ is_a_theorem(X3) ),
    inference(spm,[status(thm)],[c_0_7,c_0_17]) ).

cnf(c_0_24,plain,
    is_a_theorem(implies(X1,X1)),
    inference(spm,[status(thm)],[c_0_19,c_0_20]) ).

cnf(c_0_25,negated_conjecture,
    ( ~ is_a_theorem(implies(implies(a,implies(a,b)),X1))
    | ~ is_a_theorem(implies(X1,implies(a,b))) ),
    inference(spm,[status(thm)],[c_0_21,c_0_22]) ).

cnf(c_0_26,plain,
    ( is_a_theorem(implies(implies(X1,X2),X2))
    | ~ is_a_theorem(X1) ),
    inference(spm,[status(thm)],[c_0_23,c_0_24]) ).

cnf(c_0_27,negated_conjecture,
    ( ~ is_a_theorem(implies(implies(a,implies(a,b)),implies(X1,implies(a,b))))
    | ~ is_a_theorem(X1) ),
    inference(spm,[status(thm)],[c_0_25,c_0_26]) ).

cnf(c_0_28,negated_conjecture,
    ~ is_a_theorem(implies(not(a),implies(a,b))),
    inference(spm,[status(thm)],[c_0_27,c_0_8]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13  % Problem    : LCL041-1 : TPTP v9.2.1. Released v1.0.0.
% 0.12/0.13  % 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 : n003.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   : Mon May  4 21:54:11 EDT 2026
% 0.14/0.32  % CPUTime    : 
% 0.14/0.33  % start to proof: theBenchmark
% 1.37/1.74  % Version  : CSE_E---1.7
% 1.37/1.74  % Problem  : theBenchmark.p
% 1.37/1.74  % SZS status Unsatisfiable for theBenchmark.p
% 1.37/1.74  % SZS output start CNFRefutation
% See solution above
% 1.37/1.74  % Total time : 1.366s
%------------------------------------------------------------------------------