↑ Up

CSE_E---1.7.UNS-CRf.s

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

% Result   : Unsatisfiable 6.05s 4.54s
% Output   : CNFRefutation 6.05s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   30
%            Number of leaves      :    3
% Syntax   : Number of clauses     :   51 (  24 unt;   0 nHn;  22 RR)
%            Number of literals    :   85 (   0 equ;  36 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;   3 con; 0-2 aty)
%            Number of variables   :  128 (   1 sgn)

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

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

cnf(prove_pym,negated_conjecture,
    ~ is_a_theorem(equivalent(equivalent(equivalent(a,equivalent(b,c)),b),equivalent(c,a))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_pym) ).

cnf(c_0_3,axiom,
    ( is_a_theorem(X2)
    | ~ is_a_theorem(equivalent(X1,X2))
    | ~ is_a_theorem(X1) ),
    condensed_detachment ).

cnf(c_0_4,axiom,
    is_a_theorem(equivalent(X1,equivalent(equivalent(X2,equivalent(X3,X1)),equivalent(X3,X2)))),
    xgk ).

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

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

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

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

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

cnf(c_0_10,plain,
    ( is_a_theorem(equivalent(X1,equivalent(X2,X2)))
    | ~ is_a_theorem(X1) ),
    inference(spm,[status(thm)],[c_0_9,c_0_4]) ).

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

cnf(c_0_12,plain,
    ( is_a_theorem(equivalent(X1,X1))
    | ~ is_a_theorem(X2) ),
    inference(spm,[status(thm)],[c_0_3,c_0_10]) ).

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

cnf(c_0_14,plain,
    is_a_theorem(equivalent(X1,X1)),
    inference(spm,[status(thm)],[c_0_12,c_0_4]) ).

cnf(c_0_15,plain,
    is_a_theorem(equivalent(equivalent(X1,equivalent(X1,X2)),X2)),
    inference(spm,[status(thm)],[c_0_13,c_0_4]) ).

cnf(c_0_16,plain,
    ( is_a_theorem(X1)
    | ~ is_a_theorem(equivalent(X1,X2))
    | ~ is_a_theorem(X2) ),
    inference(spm,[status(thm)],[c_0_8,c_0_10]) ).

cnf(c_0_17,plain,
    is_a_theorem(equivalent(X1,equivalent(X1,equivalent(X2,X2)))),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_18,plain,
    is_a_theorem(equivalent(X1,equivalent(X2,equivalent(X2,equivalent(X1,equivalent(X3,X3)))))),
    inference(spm,[status(thm)],[c_0_13,c_0_15]) ).

cnf(c_0_19,plain,
    ( is_a_theorem(X1)
    | ~ is_a_theorem(equivalent(X1,equivalent(X2,X2))) ),
    inference(spm,[status(thm)],[c_0_16,c_0_17]) ).

cnf(c_0_20,plain,
    ( is_a_theorem(equivalent(X1,X2))
    | ~ is_a_theorem(equivalent(X1,equivalent(X2,equivalent(X3,X3)))) ),
    inference(spm,[status(thm)],[c_0_6,c_0_18]) ).

cnf(c_0_21,plain,
    ( is_a_theorem(equivalent(X1,equivalent(X2,equivalent(X3,X3))))
    | ~ is_a_theorem(equivalent(X2,X1)) ),
    inference(spm,[status(thm)],[c_0_19,c_0_7]) ).

cnf(c_0_22,plain,
    ( is_a_theorem(equivalent(X1,X2))
    | ~ is_a_theorem(equivalent(X2,X1)) ),
    inference(spm,[status(thm)],[c_0_20,c_0_21]) ).

cnf(c_0_23,plain,
    is_a_theorem(equivalent(equivalent(equivalent(X1,equivalent(X2,X3)),equivalent(X2,X1)),X3)),
    inference(spm,[status(thm)],[c_0_22,c_0_4]) ).

cnf(c_0_24,plain,
    is_a_theorem(equivalent(X1,equivalent(X2,equivalent(X1,X2)))),
    inference(spm,[status(thm)],[c_0_11,c_0_23]) ).

cnf(c_0_25,plain,
    is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X1)),X2)),
    inference(spm,[status(thm)],[c_0_22,c_0_24]) ).

cnf(c_0_26,plain,
    is_a_theorem(equivalent(X1,equivalent(X2,equivalent(equivalent(X1,equivalent(X3,X3)),X2)))),
    inference(spm,[status(thm)],[c_0_13,c_0_25]) ).

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

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

cnf(c_0_29,plain,
    ( is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X2)),X3))
    | ~ is_a_theorem(equivalent(X3,X1)) ),
    inference(spm,[status(thm)],[c_0_8,c_0_26]) ).

cnf(c_0_30,plain,
    ( is_a_theorem(equivalent(X1,X2))
    | ~ is_a_theorem(equivalent(X3,X2))
    | ~ is_a_theorem(equivalent(X3,X1)) ),
    inference(spm,[status(thm)],[c_0_6,c_0_27]) ).

cnf(c_0_31,plain,
    ( is_a_theorem(X1)
    | ~ is_a_theorem(equivalent(equivalent(X1,X2),X2)) ),
    inference(spm,[status(thm)],[c_0_28,c_0_29]) ).

cnf(c_0_32,plain,
    ( is_a_theorem(equivalent(X1,equivalent(X2,equivalent(X3,X2))))
    | ~ is_a_theorem(equivalent(X3,X1)) ),
    inference(spm,[status(thm)],[c_0_30,c_0_24]) ).

cnf(c_0_33,plain,
    ( is_a_theorem(X1)
    | ~ is_a_theorem(equivalent(X2,equivalent(X1,equivalent(X3,equivalent(X2,X3))))) ),
    inference(spm,[status(thm)],[c_0_31,c_0_32]) ).

cnf(c_0_34,plain,
    is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X2,X1))),
    inference(spm,[status(thm)],[c_0_33,c_0_4]) ).

cnf(c_0_35,plain,
    ( is_a_theorem(equivalent(X1,X2))
    | ~ is_a_theorem(equivalent(equivalent(X3,equivalent(X2,X3)),X1)) ),
    inference(spm,[status(thm)],[c_0_30,c_0_25]) ).

cnf(c_0_36,plain,
    is_a_theorem(equivalent(X1,equivalent(X2,equivalent(X2,X1)))),
    inference(spm,[status(thm)],[c_0_20,c_0_4]) ).

cnf(c_0_37,plain,
    ( is_a_theorem(equivalent(X1,equivalent(X2,X3)))
    | ~ is_a_theorem(equivalent(equivalent(X3,X2),X1)) ),
    inference(spm,[status(thm)],[c_0_30,c_0_34]) ).

cnf(c_0_38,plain,
    is_a_theorem(equivalent(equivalent(X1,equivalent(X1,equivalent(X2,equivalent(X3,X2)))),X3)),
    inference(spm,[status(thm)],[c_0_35,c_0_36]) ).

cnf(c_0_39,plain,
    is_a_theorem(equivalent(X1,equivalent(equivalent(X2,X3),equivalent(X3,equivalent(X2,X1))))),
    inference(spm,[status(thm)],[c_0_37,c_0_23]) ).

cnf(c_0_40,plain,
    is_a_theorem(equivalent(X1,equivalent(X2,equivalent(X2,equivalent(X3,equivalent(X1,X3)))))),
    inference(spm,[status(thm)],[c_0_22,c_0_38]) ).

cnf(c_0_41,plain,
    ( is_a_theorem(equivalent(X1,equivalent(X2,X3)))
    | ~ is_a_theorem(equivalent(equivalent(X2,X1),X3)) ),
    inference(spm,[status(thm)],[c_0_8,c_0_39]) ).

cnf(c_0_42,plain,
    is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(X2,equivalent(X1,X3))),X3)),
    inference(spm,[status(thm)],[c_0_22,c_0_39]) ).

cnf(c_0_43,plain,
    ( is_a_theorem(equivalent(X1,X2))
    | ~ is_a_theorem(equivalent(X1,equivalent(X3,equivalent(X2,X3)))) ),
    inference(spm,[status(thm)],[c_0_6,c_0_40]) ).

cnf(c_0_44,plain,
    is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X3)),equivalent(equivalent(X2,X1),X3))),
    inference(spm,[status(thm)],[c_0_41,c_0_42]) ).

cnf(c_0_45,plain,
    is_a_theorem(equivalent(equivalent(X1,equivalent(X2,equivalent(X3,equivalent(X2,X1)))),X3)),
    inference(spm,[status(thm)],[c_0_43,c_0_44]) ).

cnf(c_0_46,plain,
    is_a_theorem(equivalent(equivalent(X1,equivalent(X2,equivalent(X1,X3))),equivalent(X3,X2))),
    inference(spm,[status(thm)],[c_0_41,c_0_45]) ).

cnf(c_0_47,plain,
    is_a_theorem(equivalent(equivalent(X1,X2),equivalent(equivalent(X2,equivalent(X3,X1)),X3))),
    inference(spm,[status(thm)],[c_0_37,c_0_46]) ).

cnf(c_0_48,negated_conjecture,
    ~ is_a_theorem(equivalent(equivalent(equivalent(a,equivalent(b,c)),b),equivalent(c,a))),
    prove_pym ).

cnf(c_0_49,plain,
    is_a_theorem(equivalent(equivalent(equivalent(X1,equivalent(X2,X3)),X2),equivalent(X3,X1))),
    inference(spm,[status(thm)],[c_0_22,c_0_47]) ).

cnf(c_0_50,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_48,c_0_49])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem    : LCL019-1 : TPTP v9.2.1. Released v1.0.0.
% 0.00/0.11  % 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.32  % Computer : n023.cluster.edu
% 0.15/0.32  % Model    : x86_64 x86_64
% 0.15/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.32  % Memory   : 8042.1875MB
% 0.15/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.32  % CPULimit   : 300
% 0.15/0.32  % WCLimit    : 300
% 0.15/0.32  % DateTime   : Mon May  4 21:52:53 EDT 2026
% 0.15/0.32  % CPUTime    : 
% 0.15/0.33  % start to proof: theBenchmark
% 6.05/4.54  % Version  : CSE_E---1.7
% 6.05/4.54  % Problem  : theBenchmark.p
% 6.05/4.54  % SZS status Unsatisfiable for theBenchmark.p
% 6.05/4.54  % SZS output start CNFRefutation
% See solution above
% 6.05/4.56  % Total time : 3.371s
%------------------------------------------------------------------------------