↑ Up

CSE_E---1.7.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : LCL083-2 : TPTP v9.2.1. Bugfixed v1.2.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 : n019.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:21 PM UTC 2026

% Result   : Unsatisfiable 1.63s 1.84s
% Output   : CNFRefutation 1.63s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   16
%            Number of leaves      :    4
% Syntax   : Number of clauses     :   30 (  20 unt;   0 nHn;   5 RR)
%            Number of literals    :   42 (   0 equ;  14 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    :    3 (   3 usr;   2 con; 0-2 aty)
%            Number of variables   :   91 (  47 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(ic_JLukasiewicz,axiom,
    is_a_theorem(implies(implies(implies(X1,X2),X3),implies(implies(X3,X1),implies(X4,X1)))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ic_JLukasiewicz) ).

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

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

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

cnf(c_0_5,axiom,
    is_a_theorem(implies(implies(implies(X1,X2),X3),implies(implies(X3,X1),implies(X4,X1)))),
    ic_JLukasiewicz ).

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

cnf(c_0_7,axiom,
    is_a_theorem(implies(X1,X1)),
    ic_1 ).

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

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

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

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

cnf(c_0_12,plain,
    is_a_theorem(implies(implies(implies(X1,implies(X2,X3)),implies(X4,X2)),implies(X5,implies(X4,X2)))),
    inference(spm,[status(thm)],[c_0_6,c_0_10]) ).

cnf(c_0_13,plain,
    is_a_theorem(implies(implies(implies(X1,X1),X2),implies(X3,X2))),
    inference(spm,[status(thm)],[c_0_6,c_0_11]) ).

cnf(c_0_14,plain,
    ( is_a_theorem(implies(X1,implies(X2,X3)))
    | ~ is_a_theorem(implies(implies(X4,implies(X3,X5)),implies(X2,X3))) ),
    inference(spm,[status(thm)],[c_0_4,c_0_12]) ).

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

cnf(c_0_16,plain,
    is_a_theorem(implies(X1,implies(implies(implies(implies(X2,X3),X4),X3),implies(X2,X3)))),
    inference(spm,[status(thm)],[c_0_14,c_0_5]) ).

cnf(c_0_17,plain,
    is_a_theorem(implies(X1,implies(implies(implies(X2,X3),X2),implies(X4,X2)))),
    inference(spm,[status(thm)],[c_0_15,c_0_5]) ).

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

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

cnf(c_0_20,plain,
    is_a_theorem(implies(implies(implies(implies(X1,X2),X3),X2),implies(X1,X2))),
    inference(spm,[status(thm)],[c_0_18,c_0_5]) ).

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

cnf(c_0_22,plain,
    is_a_theorem(implies(implies(implies(X1,X2),implies(implies(X1,X2),X3)),implies(X4,implies(implies(X1,X2),X3)))),
    inference(spm,[status(thm)],[c_0_6,c_0_20]) ).

cnf(c_0_23,plain,
    is_a_theorem(implies(X1,implies(X2,implies(implies(implies(X3,X4),X3),X3)))),
    inference(spm,[status(thm)],[c_0_21,c_0_22]) ).

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

cnf(c_0_25,plain,
    is_a_theorem(implies(X1,implies(implies(implies(X2,X3),X2),X2))),
    inference(spm,[status(thm)],[c_0_24,c_0_5]) ).

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

cnf(c_0_27,negated_conjecture,
    ~ is_a_theorem(implies(implies(implies(a,b),a),a)),
    prove_ic_3 ).

cnf(c_0_28,plain,
    is_a_theorem(implies(implies(implies(X1,X2),X1),X1)),
    inference(spm,[status(thm)],[c_0_26,c_0_5]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : LCL083-2 : TPTP v9.2.1. Bugfixed v1.2.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.14/0.32  % Computer : n019.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:57:59 EDT 2026
% 0.14/0.33  % CPUTime    : 
% 0.14/0.34  % start to proof: theBenchmark
% 1.63/1.84  % Version  : CSE_E---1.7
% 1.63/1.84  % Problem  : theBenchmark.p
% 1.63/1.84  % SZS status Unsatisfiable for theBenchmark.p
% 1.63/1.84  % SZS output start CNFRefutation
% See solution above
% 1.63/1.85  % Total time : 1.371s
%------------------------------------------------------------------------------