↑ Up

CSE_E---1.7.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : SWX186-1 : TPTP v9.3.0. Released v9.3.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 : n005.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:34:39 PM UTC 2026

% Result   : Unsatisfiable 1.24s 1.71s
% Output   : CNFRefutation 1.24s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   20 (  20 unt;   0 nHn;   6 RR)
%            Number of literals    :   20 (  19 equ;   5 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   3 con; 0-3 aty)
%            Number of variables   :   37 (  17 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(goal,negated_conjecture,
    eq3(prop_drop_inj2(X1,X2,X3),bfalse) != btrue,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goal) ).

cnf(axiom_005,axiom,
    prop_drop_inj2(X1,X2,X3) = impl(eq(drop(X1,X2),drop(X1,X3)),eq(X2,X3)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_005) ).

cnf(axiom_002,axiom,
    drop(s(X1),nil) = nil,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_002) ).

cnf(axiom_017,axiom,
    eq(cons(X1,X2),nil) = bfalse,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_017) ).

cnf(axiom_003,axiom,
    drop(s(X1),cons(X2,X3)) = drop(X1,X3),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_003) ).

cnf(axiom_011,axiom,
    eq(X1,X1) = btrue,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_011) ).

cnf(axiom,axiom,
    impl(btrue,X1) = X1,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom) ).

cnf(axiom_013,axiom,
    eq3(X1,X1) = btrue,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_013) ).

cnf(c_0_8,negated_conjecture,
    eq3(prop_drop_inj2(X1,X2,X3),bfalse) != btrue,
    goal ).

cnf(c_0_9,axiom,
    prop_drop_inj2(X1,X2,X3) = impl(eq(drop(X1,X2),drop(X1,X3)),eq(X2,X3)),
    axiom_005 ).

cnf(c_0_10,negated_conjecture,
    eq3(impl(eq(drop(X1,X2),drop(X1,X3)),eq(X2,X3)),bfalse) != btrue,
    inference(rw,[status(thm)],[c_0_8,c_0_9]) ).

cnf(c_0_11,axiom,
    drop(s(X1),nil) = nil,
    axiom_002 ).

cnf(c_0_12,negated_conjecture,
    eq3(impl(eq(drop(s(X1),X2),nil),eq(X2,nil)),bfalse) != btrue,
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_13,axiom,
    eq(cons(X1,X2),nil) = bfalse,
    axiom_017 ).

cnf(c_0_14,axiom,
    drop(s(X1),cons(X2,X3)) = drop(X1,X3),
    axiom_003 ).

cnf(c_0_15,negated_conjecture,
    eq3(impl(eq(drop(X1,X2),nil),bfalse),bfalse) != btrue,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]) ).

cnf(c_0_16,axiom,
    eq(X1,X1) = btrue,
    axiom_011 ).

cnf(c_0_17,axiom,
    impl(btrue,X1) = X1,
    axiom ).

cnf(c_0_18,axiom,
    eq3(X1,X1) = btrue,
    axiom_013 ).

cnf(c_0_19,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_11]),c_0_16]),c_0_17]),c_0_18])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem    : SWX186-1 : TPTP v9.3.0. Released v9.3.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.14/0.32  % Computer : n005.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   : Tue May  5 07:54:00 EDT 2026
% 0.14/0.32  % CPUTime    : 
% 0.14/0.33  % start to proof: theBenchmark
% 1.24/1.71  % Version  : CSE_E---1.7
% 1.24/1.71  % Problem  : theBenchmark.p
% 1.24/1.71  % SZS status Unsatisfiable for theBenchmark.p
% 1.24/1.71  % SZS output start CNFRefutation
% See solution above
% 1.24/1.71  % Total time : 1.371s
%------------------------------------------------------------------------------