↑ Up

CSE_E---1.7.UNS-CRf.s

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

% Result   : Unsatisfiable 4.09s 3.20s
% Output   : CNFRefutation 4.09s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   14
%            Number of leaves      :    2
% Syntax   : Number of clauses     :   19 (  19 unt;   0 nHn;   3 RR)
%            Number of literals    :   19 (  18 equ;   2 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :   14 (   4 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :   59 (   0 sgn)

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

cnf(prove_these_axioms_1,negated_conjecture,
    multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms_1) ).

cnf(c_0_2,axiom,
    inverse(multiply(inverse(multiply(X1,inverse(multiply(inverse(X2),inverse(multiply(X3,inverse(multiply(inverse(X3),X3)))))))),multiply(X1,X3))) = X2,
    single_axiom ).

cnf(c_0_3,plain,
    inverse(multiply(inverse(multiply(X1,inverse(multiply(X2,inverse(multiply(X3,inverse(multiply(inverse(X3),X3)))))))),multiply(X1,X3))) = multiply(inverse(multiply(X4,inverse(multiply(inverse(X2),inverse(multiply(X5,inverse(multiply(inverse(X5),X5)))))))),multiply(X4,X5)),
    inference(spm,[status(thm)],[c_0_2,c_0_2]) ).

cnf(c_0_4,plain,
    multiply(inverse(multiply(X1,inverse(multiply(inverse(inverse(X2)),inverse(multiply(X3,inverse(multiply(inverse(X3),X3)))))))),multiply(X1,X3)) = X2,
    inference(spm,[status(thm)],[c_0_2,c_0_3]) ).

cnf(c_0_5,plain,
    inverse(multiply(inverse(multiply(inverse(multiply(X1,inverse(multiply(inverse(inverse(X2)),inverse(multiply(X3,inverse(multiply(inverse(X3),X3)))))))),inverse(multiply(inverse(X4),inverse(multiply(multiply(X1,X3),inverse(multiply(inverse(multiply(X1,X3)),multiply(X1,X3))))))))),X2)) = X4,
    inference(spm,[status(thm)],[c_0_2,c_0_4]) ).

cnf(c_0_6,plain,
    inverse(multiply(inverse(multiply(X1,X2)),multiply(X1,X3))) = multiply(inverse(multiply(X4,inverse(multiply(inverse(inverse(inverse(multiply(X3,inverse(multiply(inverse(X3),X3)))))),inverse(multiply(X5,inverse(multiply(inverse(X5),X5)))))))),inverse(multiply(inverse(X2),inverse(multiply(multiply(X4,X5),inverse(multiply(inverse(multiply(X4,X5)),multiply(X4,X5)))))))),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_5]),c_0_4]) ).

cnf(c_0_7,plain,
    inverse(multiply(inverse(multiply(X1,X2)),multiply(X1,X3))) = inverse(multiply(inverse(multiply(X4,X2)),multiply(X4,X3))),
    inference(spm,[status(thm)],[c_0_6,c_0_6]) ).

cnf(c_0_8,plain,
    multiply(inverse(multiply(X1,X2)),multiply(X1,X3)) = multiply(inverse(multiply(X4,X2)),multiply(X4,X3)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2,c_0_7]),c_0_2]) ).

cnf(c_0_9,plain,
    inverse(multiply(inverse(multiply(X1,inverse(multiply(inverse(X2),inverse(multiply(multiply(X3,X4),inverse(multiply(inverse(multiply(X5,X4)),multiply(X5,X4))))))))),multiply(X1,multiply(X3,X4)))) = X2,
    inference(spm,[status(thm)],[c_0_2,c_0_8]) ).

cnf(c_0_10,plain,
    multiply(inverse(multiply(inverse(multiply(X1,inverse(multiply(inverse(inverse(X2)),inverse(multiply(X3,inverse(multiply(inverse(X3),X3)))))))),inverse(multiply(inverse(inverse(X4)),inverse(multiply(multiply(X1,X3),inverse(multiply(inverse(multiply(X1,X3)),multiply(X1,X3))))))))),X2) = X4,
    inference(spm,[status(thm)],[c_0_4,c_0_4]) ).

cnf(c_0_11,plain,
    inverse(multiply(inverse(multiply(X1,inverse(multiply(inverse(X2),inverse(multiply(X3,inverse(multiply(inverse(multiply(X4,X5)),multiply(X4,X5))))))))),multiply(X1,X3))) = X2,
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

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

cnf(c_0_13,plain,
    inverse(multiply(inverse(multiply(X1,inverse(multiply(inverse(X2),inverse(multiply(X3,inverse(multiply(inverse(X4),X4)))))))),multiply(X1,X3))) = X2,
    inference(spm,[status(thm)],[c_0_11,c_0_4]) ).

cnf(c_0_14,plain,
    multiply(inverse(X1),inverse(multiply(X2,inverse(multiply(inverse(X2),X2))))) = multiply(inverse(X1),inverse(multiply(X2,inverse(multiply(inverse(X3),X3))))),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_15,plain,
    multiply(X1,inverse(multiply(inverse(X1),X1))) = multiply(X1,inverse(multiply(inverse(X2),X2))),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_14]),c_0_12]) ).

cnf(c_0_16,negated_conjecture,
    multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
    prove_these_axioms_1 ).

cnf(c_0_17,plain,
    multiply(inverse(X1),X1) = multiply(inverse(X2),X2),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_15]),c_0_12]) ).

cnf(c_0_18,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[c_0_16,c_0_17]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : GRP418-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.13/0.32  % Computer : n018.cluster.edu
% 0.13/0.32  % Model    : x86_64 x86_64
% 0.13/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.32  % Memory   : 8042.1875MB
% 0.13/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.32  % CPULimit   : 300
% 0.13/0.32  % WCLimit    : 300
% 0.13/0.32  % DateTime   : Mon May  4 18:35:32 EDT 2026
% 0.13/0.32  % CPUTime    : 
% 0.13/0.33  % start to proof: theBenchmark
% 4.09/3.20  % Version  : CSE_E---1.7
% 4.09/3.20  % Problem  : theBenchmark.p
% 4.09/3.20  % SZS status Unsatisfiable for theBenchmark.p
% 4.09/3.20  % SZS output start CNFRefutation
% See solution above
% 4.09/3.21  % Total time : 2.373s
%------------------------------------------------------------------------------