↑ Up

CSE_E---1.7.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : GRP658-10 : TPTP v9.2.1. Released v8.1.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 : n002.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:26:46 PM UTC 2026

% Result   : Unsatisfiable 1.27s 1.74s
% Output   : CNFRefutation 1.27s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   17
%            Number of leaves      :    6
% Syntax   : Number of clauses     :   36 (  36 unt;   0 nHn;   4 RR)
%            Number of literals    :   36 (  35 equ;   3 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   0 con; 1-2 aty)
%            Number of variables   :   85 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(f04,axiom,
    rd(mult(X1,X2),X2) = X1,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f04) ).

cnf(f05,axiom,
    mult(mult(X1,mult(X2,X2)),X3) = mult(mult(X1,X2),mult(X2,X3)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f05) ).

cnf(f01,axiom,
    mult(X1,ld(X1,X2)) = X2,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f01) ).

cnf(f02,axiom,
    ld(X1,mult(X1,X2)) = X2,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f02) ).

cnf(f03,axiom,
    mult(rd(X1,X2),X2) = X1,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f03) ).

cnf(goal,negated_conjecture,
    tuple(mult(X1,x1(X1)),mult(x1_2(X1),X1)) != tuple(x1(X1),x1_2(X1)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goal) ).

cnf(c_0_6,axiom,
    rd(mult(X1,X2),X2) = X1,
    f04 ).

cnf(c_0_7,axiom,
    mult(mult(X1,mult(X2,X2)),X3) = mult(mult(X1,X2),mult(X2,X3)),
    f05 ).

cnf(c_0_8,plain,
    rd(mult(mult(X1,X2),mult(X2,X3)),X3) = mult(X1,mult(X2,X2)),
    inference(spm,[status(thm)],[c_0_6,c_0_7]) ).

cnf(c_0_9,axiom,
    mult(X1,ld(X1,X2)) = X2,
    f01 ).

cnf(c_0_10,axiom,
    ld(X1,mult(X1,X2)) = X2,
    f02 ).

cnf(c_0_11,axiom,
    mult(rd(X1,X2),X2) = X1,
    f03 ).

cnf(c_0_12,plain,
    rd(mult(mult(X1,X2),X3),ld(X2,X3)) = mult(X1,mult(X2,X2)),
    inference(spm,[status(thm)],[c_0_8,c_0_9]) ).

cnf(c_0_13,plain,
    ld(rd(X1,X2),X1) = X2,
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_14,plain,
    rd(X1,ld(X2,ld(mult(X3,X2),X1))) = mult(X3,mult(X2,X2)),
    inference(spm,[status(thm)],[c_0_12,c_0_9]) ).

cnf(c_0_15,plain,
    ld(X1,ld(mult(X2,X1),X3)) = ld(mult(X2,mult(X1,X1)),X3),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_16,plain,
    ld(mult(rd(X1,X2),mult(X2,X2)),X3) = ld(X2,ld(X1,X3)),
    inference(spm,[status(thm)],[c_0_15,c_0_11]) ).

cnf(c_0_17,plain,
    mult(X1,mult(rd(X2,X3),rd(X2,X3))) = rd(mult(mult(X1,rd(X2,X3)),X2),X3),
    inference(spm,[status(thm)],[c_0_8,c_0_11]) ).

cnf(c_0_18,plain,
    ld(rd(X1,X2),ld(X3,X4)) = ld(rd(mult(X3,X1),X2),X4),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_11]) ).

cnf(c_0_19,plain,
    ld(rd(mult(rd(X1,X2),X3),X4),X1) = ld(rd(X3,X4),X2),
    inference(spm,[status(thm)],[c_0_18,c_0_13]) ).

cnf(c_0_20,plain,
    ld(rd(X1,X1),X2) = X2,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_6]),c_0_13]) ).

cnf(c_0_21,plain,
    rd(X1,ld(X2,X1)) = X2,
    inference(spm,[status(thm)],[c_0_6,c_0_9]) ).

cnf(c_0_22,plain,
    ld(rd(X1,mult(rd(X2,X3),X1)),X3) = X2,
    inference(spm,[status(thm)],[c_0_19,c_0_20]) ).

cnf(c_0_23,plain,
    rd(X1,mult(rd(X2,X3),X1)) = rd(X3,X2),
    inference(spm,[status(thm)],[c_0_21,c_0_22]) ).

cnf(c_0_24,plain,
    mult(X1,ld(mult(X2,mult(X1,X1)),X3)) = ld(mult(X2,X1),X3),
    inference(spm,[status(thm)],[c_0_9,c_0_15]) ).

cnf(c_0_25,plain,
    ld(rd(X1,X2),X3) = mult(rd(X2,X1),X3),
    inference(spm,[status(thm)],[c_0_13,c_0_23]) ).

cnf(c_0_26,plain,
    ld(mult(rd(X1,mult(X2,X2)),X2),X3) = mult(X2,ld(X1,X3)),
    inference(spm,[status(thm)],[c_0_24,c_0_11]) ).

cnf(c_0_27,plain,
    mult(rd(X1,mult(X2,X1)),X3) = ld(X2,X3),
    inference(spm,[status(thm)],[c_0_25,c_0_6]) ).

cnf(c_0_28,plain,
    mult(rd(X1,X1),X2) = X2,
    inference(spm,[status(thm)],[c_0_10,c_0_20]) ).

cnf(c_0_29,plain,
    ld(ld(X1,X1),X2) = X2,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_9]) ).

cnf(c_0_30,negated_conjecture,
    tuple(mult(X1,x1(X1)),mult(x1_2(X1),X1)) != tuple(x1(X1),x1_2(X1)),
    goal ).

cnf(c_0_31,plain,
    mult(X1,ld(mult(X1,X1),X2)) = ld(X1,X2),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_28]),c_0_28]) ).

cnf(c_0_32,plain,
    rd(X1,X1) = ld(X2,X2),
    inference(spm,[status(thm)],[c_0_21,c_0_29]) ).

cnf(c_0_33,negated_conjecture,
    tuple(x1(rd(X1,X1)),mult(x1_2(rd(X1,X1)),rd(X1,X1))) != tuple(x1(rd(X1,X1)),x1_2(rd(X1,X1))),
    inference(spm,[status(thm)],[c_0_30,c_0_28]) ).

cnf(c_0_34,plain,
    mult(X1,rd(X2,X2)) = X1,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_10]) ).

cnf(c_0_35,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_34])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13  % Problem    : GRP658-10 : TPTP v9.2.1. Released v8.1.0.
% 0.11/0.13  % 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.33  % Computer : n002.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.34  % CPULimit   : 300
% 0.14/0.34  % WCLimit    : 300
% 0.14/0.34  % DateTime   : Mon May  4 19:00:01 EDT 2026
% 0.14/0.34  % CPUTime    : 
% 0.14/0.35  % start to proof: theBenchmark
% 1.27/1.74  % Version  : CSE_E---1.7
% 1.27/1.74  % Problem  : theBenchmark.p
% 1.27/1.74  % SZS status Unsatisfiable for theBenchmark.p
% 1.27/1.74  % SZS output start CNFRefutation
% See solution above
% 1.27/1.74  % Total time : 1.371s
%------------------------------------------------------------------------------