↑ Up

CSE_E---1.7.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : GRP523-1 : TPTP v9.2.1. Released v2.6.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 : n026.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:19 PM UTC 2026

% Result   : Unsatisfiable 1.32s 1.74s
% Output   : CNFRefutation 1.32s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   18
%            Number of leaves      :    4
% 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;   3 con; 0-2 aty)
%            Number of variables   :   71 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(multiply,axiom,
    multiply(X1,X2) = divide(X1,divide(divide(X3,X3),X2)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiply) ).

cnf(inverse,axiom,
    inverse(X1) = divide(divide(X2,X2),X1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',inverse) ).

cnf(single_axiom,axiom,
    divide(X1,divide(X2,divide(X3,divide(X1,X2)))) = X3,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',single_axiom) ).

cnf(prove_these_axioms_3,negated_conjecture,
    multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms_3) ).

cnf(c_0_4,axiom,
    multiply(X1,X2) = divide(X1,divide(divide(X3,X3),X2)),
    multiply ).

cnf(c_0_5,axiom,
    inverse(X1) = divide(divide(X2,X2),X1),
    inverse ).

cnf(c_0_6,axiom,
    divide(X1,divide(X2,divide(X3,divide(X1,X2)))) = X3,
    single_axiom ).

cnf(c_0_7,plain,
    divide(X1,inverse(X2)) = multiply(X1,X2),
    inference(spm,[status(thm)],[c_0_4,c_0_5]) ).

cnf(c_0_8,plain,
    inverse(divide(X1,multiply(X2,X1))) = X2,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_4]) ).

cnf(c_0_9,plain,
    inverse(inverse(X1)) = multiply(divide(X2,X2),X1),
    inference(spm,[status(thm)],[c_0_5,c_0_7]) ).

cnf(c_0_10,plain,
    inverse(multiply(X1,inverse(X1))) = divide(X2,X2),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_7]) ).

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

cnf(c_0_12,plain,
    divide(X1,X1) = multiply(inverse(X2),X2),
    inference(spm,[status(thm)],[c_0_7,c_0_11]) ).

cnf(c_0_13,plain,
    inverse(divide(X1,divide(X2,X2))) = inverse(X1),
    inference(spm,[status(thm)],[c_0_8,c_0_12]) ).

cnf(c_0_14,plain,
    inverse(inverse(multiply(X1,divide(X2,X2)))) = X1,
    inference(spm,[status(thm)],[c_0_8,c_0_5]) ).

cnf(c_0_15,plain,
    inverse(multiply(X1,divide(X2,X2))) = inverse(X1),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_5]),c_0_7]) ).

cnf(c_0_16,plain,
    inverse(inverse(X1)) = X1,
    inference(rw,[status(thm)],[c_0_14,c_0_15]) ).

cnf(c_0_17,plain,
    divide(X1,divide(X2,X2)) = X1,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_13]),c_0_16]) ).

cnf(c_0_18,plain,
    multiply(X1,divide(X2,X1)) = X2,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_17]),c_0_4]) ).

cnf(c_0_19,plain,
    divide(X1,divide(X1,X2)) = X2,
    inference(spm,[status(thm)],[c_0_6,c_0_17]) ).

cnf(c_0_20,plain,
    multiply(X1,inverse(X2)) = divide(X1,X2),
    inference(spm,[status(thm)],[c_0_7,c_0_16]) ).

cnf(c_0_21,plain,
    multiply(divide(X1,X2),X2) = X1,
    inference(spm,[status(thm)],[c_0_18,c_0_19]) ).

cnf(c_0_22,plain,
    divide(multiply(X1,X2),X2) = X1,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_7]) ).

cnf(c_0_23,plain,
    divide(X1,multiply(X1,X2)) = inverse(X2),
    inference(spm,[status(thm)],[c_0_19,c_0_7]) ).

cnf(c_0_24,plain,
    multiply(X1,X2) = multiply(X2,X1),
    inference(spm,[status(thm)],[c_0_18,c_0_22]) ).

cnf(c_0_25,plain,
    divide(multiply(X1,X2),X1) = X2,
    inference(spm,[status(thm)],[c_0_19,c_0_22]) ).

cnf(c_0_26,plain,
    inverse(divide(X1,X2)) = divide(X2,X1),
    inference(spm,[status(thm)],[c_0_23,c_0_18]) ).

cnf(c_0_27,plain,
    multiply(inverse(X1),X2) = divide(X2,X1),
    inference(spm,[status(thm)],[c_0_20,c_0_24]) ).

cnf(c_0_28,plain,
    multiply(divide(X1,X2),X3) = divide(X1,divide(X2,X3)),
    inference(spm,[status(thm)],[c_0_6,c_0_25]) ).

cnf(c_0_29,plain,
    inverse(multiply(X1,X2)) = divide(inverse(X2),X1),
    inference(spm,[status(thm)],[c_0_26,c_0_7]) ).

cnf(c_0_30,negated_conjecture,
    multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
    prove_these_axioms_3 ).

cnf(c_0_31,plain,
    divide(X1,divide(X2,X3)) = divide(X3,divide(X2,X1)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_26]),c_0_28]) ).

cnf(c_0_32,plain,
    divide(X1,divide(inverse(X2),X3)) = multiply(X1,multiply(X3,X2)),
    inference(spm,[status(thm)],[c_0_7,c_0_29]) ).

cnf(c_0_33,negated_conjecture,
    multiply(c3,multiply(a3,b3)) != multiply(a3,multiply(b3,c3)),
    inference(rw,[status(thm)],[c_0_30,c_0_24]) ).

cnf(c_0_34,plain,
    multiply(X1,multiply(X2,X3)) = multiply(X2,multiply(X1,X3)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_32]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : GRP523-1 : TPTP v9.2.1. Released v2.6.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.16/0.33  % Computer : n026.cluster.edu
% 0.16/0.33  % Model    : x86_64 x86_64
% 0.16/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.33  % Memory   : 8042.1875MB
% 0.16/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.33  % CPULimit   : 300
% 0.16/0.33  % WCLimit    : 300
% 0.16/0.33  % DateTime   : Mon May  4 18:41:23 EDT 2026
% 0.16/0.33  % CPUTime    : 
% 0.16/0.34  % start to proof: theBenchmark
% 1.32/1.74  % Version  : CSE_E---1.7
% 1.32/1.74  % Problem  : theBenchmark.p
% 1.32/1.74  % SZS status Unsatisfiable for theBenchmark.p
% 1.32/1.74  % SZS output start CNFRefutation
% See solution above
% 1.32/1.74  % Total time : 1.369s
%------------------------------------------------------------------------------