↑ Up

CSE_E---1.7.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : SYN566-1 : TPTP v9.2.1. Released v2.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 : n013.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 05:39:39 PM UTC 2026

% Result   : Unsatisfiable 1.26s 1.72s
% Output   : CNFRefutation 1.26s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   13
% Syntax   : Number of clauses     :   40 (  16 unt;   0 nHn;  34 RR)
%            Number of literals    :   80 (   0 equ;  47 neg)
%            Maximal clause size   :    4 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    6 (   5 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   5 con; 0-1 aty)
%            Number of variables   :   57 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(p3_14,negated_conjecture,
    ( p3(X1,X2)
    | ~ p3(X3,X1)
    | ~ p3(X3,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p3_14) ).

cnf(p3_3,negated_conjecture,
    p3(X1,X1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p3_3) ).

cnf(not_p10_19,negated_conjecture,
    ( ~ p10(X1,c11)
    | ~ p8(c12,X2)
    | ~ p3(X2,f4(X3))
    | ~ p2(X3,f5(X1)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_p10_19) ).

cnf(p8_18,negated_conjecture,
    ( p8(X1,X2)
    | ~ p7(X3,X1)
    | ~ p8(X3,X4)
    | ~ p3(X4,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p8_18) ).

cnf(p8_6,negated_conjecture,
    p8(c12,c13),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p8_6) ).

cnf(p3_8,negated_conjecture,
    p3(c13,f4(c14)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p3_8) ).

cnf(p8_16,negated_conjecture,
    ( p8(X1,f4(f5(X2)))
    | ~ p8(X1,f4(f6(X2))) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p8_16) ).

cnf(p7_4,negated_conjecture,
    p7(X1,X1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p7_4) ).

cnf(p3_9,negated_conjecture,
    ( p3(f4(X1),f4(X2))
    | ~ p2(X1,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p3_9) ).

cnf(p2_2,negated_conjecture,
    p2(X1,X1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p2_2) ).

cnf(p2_13,negated_conjecture,
    ( p2(X1,X2)
    | ~ p2(X3,X1)
    | ~ p2(X3,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p2_13) ).

cnf(p2_7,negated_conjecture,
    p2(c14,f6(c15)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p2_7) ).

cnf(p10_5,negated_conjecture,
    p10(c15,c11),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p10_5) ).

cnf(c_0_13,negated_conjecture,
    ( p3(X1,X2)
    | ~ p3(X3,X1)
    | ~ p3(X3,X2) ),
    p3_14 ).

cnf(c_0_14,negated_conjecture,
    p3(X1,X1),
    p3_3 ).

cnf(c_0_15,negated_conjecture,
    ( ~ p10(X1,c11)
    | ~ p8(c12,X2)
    | ~ p3(X2,f4(X3))
    | ~ p2(X3,f5(X1)) ),
    not_p10_19 ).

cnf(c_0_16,negated_conjecture,
    ( p8(X1,X2)
    | ~ p7(X3,X1)
    | ~ p8(X3,X4)
    | ~ p3(X4,X2) ),
    p8_18 ).

cnf(c_0_17,negated_conjecture,
    p8(c12,c13),
    p8_6 ).

cnf(c_0_18,negated_conjecture,
    ( p3(X1,X2)
    | ~ p3(X2,X1) ),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_19,negated_conjecture,
    p3(c13,f4(c14)),
    p3_8 ).

cnf(c_0_20,negated_conjecture,
    ( ~ p8(c12,f4(X1))
    | ~ p10(X2,c11)
    | ~ p2(X1,f5(X2)) ),
    inference(spm,[status(thm)],[c_0_15,c_0_14]) ).

cnf(c_0_21,negated_conjecture,
    ( p8(X1,f4(f5(X2)))
    | ~ p8(X1,f4(f6(X2))) ),
    p8_16 ).

cnf(c_0_22,negated_conjecture,
    ( p8(X1,X2)
    | ~ p7(c12,X1)
    | ~ p3(c13,X2) ),
    inference(spm,[status(thm)],[c_0_16,c_0_17]) ).

cnf(c_0_23,negated_conjecture,
    p7(X1,X1),
    p7_4 ).

cnf(c_0_24,negated_conjecture,
    p3(f4(c14),c13),
    inference(spm,[status(thm)],[c_0_18,c_0_19]) ).

cnf(c_0_25,negated_conjecture,
    ( ~ p8(c12,f4(f6(X1)))
    | ~ p10(X2,c11)
    | ~ p2(f5(X1),f5(X2)) ),
    inference(spm,[status(thm)],[c_0_20,c_0_21]) ).

cnf(c_0_26,negated_conjecture,
    ( p8(c12,X1)
    | ~ p3(c13,X1) ),
    inference(spm,[status(thm)],[c_0_22,c_0_23]) ).

cnf(c_0_27,negated_conjecture,
    ( p3(X1,c13)
    | ~ p3(f4(c14),X1) ),
    inference(spm,[status(thm)],[c_0_13,c_0_24]) ).

cnf(c_0_28,negated_conjecture,
    ( p3(f4(X1),f4(X2))
    | ~ p2(X1,X2) ),
    p3_9 ).

cnf(c_0_29,negated_conjecture,
    ( ~ p10(X1,c11)
    | ~ p3(c13,f4(f6(X2)))
    | ~ p2(f5(X2),f5(X1)) ),
    inference(spm,[status(thm)],[c_0_25,c_0_26]) ).

cnf(c_0_30,negated_conjecture,
    p2(X1,X1),
    p2_2 ).

cnf(c_0_31,negated_conjecture,
    ( p3(f4(X1),c13)
    | ~ p2(c14,X1) ),
    inference(spm,[status(thm)],[c_0_27,c_0_28]) ).

cnf(c_0_32,negated_conjecture,
    ( ~ p10(X1,c11)
    | ~ p3(c13,f4(f6(X1))) ),
    inference(spm,[status(thm)],[c_0_29,c_0_30]) ).

cnf(c_0_33,negated_conjecture,
    ( p3(c13,f4(X1))
    | ~ p2(c14,X1) ),
    inference(spm,[status(thm)],[c_0_18,c_0_31]) ).

cnf(c_0_34,negated_conjecture,
    ( p2(X1,X2)
    | ~ p2(X3,X1)
    | ~ p2(X3,X2) ),
    p2_13 ).

cnf(c_0_35,negated_conjecture,
    p2(c14,f6(c15)),
    p2_7 ).

cnf(c_0_36,negated_conjecture,
    ( ~ p10(X1,c11)
    | ~ p2(c14,f6(X1)) ),
    inference(spm,[status(thm)],[c_0_32,c_0_33]) ).

cnf(c_0_37,negated_conjecture,
    ( p2(X1,f6(c15))
    | ~ p2(c14,X1) ),
    inference(spm,[status(thm)],[c_0_34,c_0_35]) ).

cnf(c_0_38,negated_conjecture,
    p10(c15,c11),
    p10_5 ).

cnf(c_0_39,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38]),c_0_30])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SYN566-1 : TPTP v9.2.1. Released v2.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.15/0.33  % Computer : n013.cluster.edu
% 0.15/0.33  % Model    : x86_64 x86_64
% 0.15/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.33  % Memory   : 8042.1875MB
% 0.15/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.33  % CPULimit   : 300
% 0.15/0.33  % WCLimit    : 300
% 0.15/0.33  % DateTime   : Tue May  5 08:38:56 EDT 2026
% 0.15/0.33  % CPUTime    : 
% 0.15/0.34  % start to proof: theBenchmark
% 1.26/1.72  % Version  : CSE_E---1.7
% 1.26/1.72  % Problem  : theBenchmark.p
% 1.26/1.72  % SZS status Unsatisfiable for theBenchmark.p
% 1.26/1.72  % SZS output start CNFRefutation
% See solution above
% 1.26/1.72  % Total time : 1.368s
%------------------------------------------------------------------------------