↑ Up

CSE_E---1.7.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : LCL366-1 : TPTP v9.2.1. Bugfixed v5.5.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 : n022.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:40:06 PM UTC 2026

% Result   : Unsatisfiable 8.69s 5.90s
% Output   : CNFRefutation 8.69s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   18
%            Number of leaves      :    5
% Syntax   : Number of clauses     :   42 (  19 unt;   0 nHn;  11 RR)
%            Number of literals    :   74 (   0 equ;  34 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    6 (   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   :  105 (  25 sgn)

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

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

cnf(cn_2,axiom,
    is_a_theorem(implies(implies(not(X1),X1),X1)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_2) ).

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

cnf(prove_cn_15,negated_conjecture,
    ~ is_a_theorem(implies(implies(not(x),y),implies(implies(y,x),x))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_cn_15) ).

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

cnf(c_0_6,axiom,
    is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))),
    cn_1 ).

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

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

cnf(c_0_9,axiom,
    is_a_theorem(implies(implies(not(X1),X1),X1)),
    cn_2 ).

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

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

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

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

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

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

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

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

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

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

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

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

cnf(c_0_22,plain,
    ( is_a_theorem(implies(X1,implies(not(X2),X3)))
    | ~ is_a_theorem(implies(implies(not(X1),X4),X2)) ),
    inference(spm,[status(thm)],[c_0_19,c_0_11]) ).

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

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

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

cnf(c_0_26,plain,
    is_a_theorem(implies(implies(not(X1),X1),implies(not(X1),X2))),
    inference(spm,[status(thm)],[c_0_22,c_0_23]) ).

cnf(c_0_27,plain,
    ( is_a_theorem(X1)
    | ~ is_a_theorem(implies(not(X1),X1)) ),
    inference(spm,[status(thm)],[c_0_5,c_0_9]) ).

cnf(c_0_28,plain,
    ( is_a_theorem(implies(X1,implies(implies(X2,X3),implies(X4,X3))))
    | ~ is_a_theorem(implies(X1,implies(X4,X2))) ),
    inference(spm,[status(thm)],[c_0_8,c_0_6]) ).

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

cnf(c_0_30,plain,
    is_a_theorem(implies(not(implies(implies(not(X1),X1),X1)),X2)),
    inference(spm,[status(thm)],[c_0_25,c_0_26]) ).

cnf(c_0_31,plain,
    ( is_a_theorem(implies(implies(X1,X2),implies(X3,X2)))
    | ~ is_a_theorem(implies(not(implies(implies(X1,X2),implies(X3,X2))),implies(X3,X1))) ),
    inference(spm,[status(thm)],[c_0_27,c_0_28]) ).

cnf(c_0_32,plain,
    is_a_theorem(implies(X1,implies(X2,implies(implies(not(X3),X3),X3)))),
    inference(spm,[status(thm)],[c_0_29,c_0_30]) ).

cnf(c_0_33,plain,
    is_a_theorem(implies(implies(implies(implies(not(X1),X1),X1),X2),implies(X3,X2))),
    inference(spm,[status(thm)],[c_0_31,c_0_32]) ).

cnf(c_0_34,plain,
    ( is_a_theorem(implies(implies(X1,X2),implies(not(X3),X4)))
    | ~ is_a_theorem(implies(implies(implies(X2,X5),implies(X1,X5)),X3)) ),
    inference(spm,[status(thm)],[c_0_19,c_0_6]) ).

cnf(c_0_35,plain,
    is_a_theorem(implies(implies(implies(implies(not(X1),X1),X1),X2),X2)),
    inference(spm,[status(thm)],[c_0_12,c_0_33]) ).

cnf(c_0_36,plain,
    is_a_theorem(implies(implies(X1,implies(not(X2),X2)),implies(not(implies(X1,X2)),X3))),
    inference(spm,[status(thm)],[c_0_34,c_0_35]) ).

cnf(c_0_37,plain,
    is_a_theorem(implies(implies(X1,implies(not(X2),X2)),implies(X1,X2))),
    inference(spm,[status(thm)],[c_0_12,c_0_36]) ).

cnf(c_0_38,plain,
    is_a_theorem(implies(implies(not(X1),X2),implies(not(implies(implies(X2,X1),X1)),X3))),
    inference(spm,[status(thm)],[c_0_34,c_0_37]) ).

cnf(c_0_39,negated_conjecture,
    ~ is_a_theorem(implies(implies(not(x),y),implies(implies(y,x),x))),
    prove_cn_15 ).

cnf(c_0_40,plain,
    is_a_theorem(implies(implies(not(X1),X2),implies(implies(X2,X1),X1))),
    inference(spm,[status(thm)],[c_0_12,c_0_38]) ).

cnf(c_0_41,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_40])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : LCL366-1 : TPTP v9.2.1. Bugfixed v5.5.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.14/0.33  % Computer : n022.cluster.edu
% 0.14/0.33  % Model    : x86_64 x86_64
% 0.14/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33  % Memory   : 8042.1875MB
% 0.14/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33  % CPULimit   : 300
% 0.14/0.33  % WCLimit    : 300
% 0.14/0.33  % DateTime   : Mon May  4 22:26:36 EDT 2026
% 0.14/0.33  % CPUTime    : 
% 0.14/0.34  % start to proof: theBenchmark
% 8.69/5.90  % Version  : CSE_E---1.7
% 8.69/5.90  % Problem  : theBenchmark.p
% 8.69/5.90  % SZS status Unsatisfiable for theBenchmark.p
% 8.69/5.90  % SZS output start CNFRefutation
% See solution above
% 8.69/5.93  % Total time : 4.368s
%------------------------------------------------------------------------------