↑ Up

PyRes---1.5.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : PyRes---1.5
% Problem  : BOO003-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s

% Computer : n004.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 : Thu May  9 17:16:42 EDT 2024

% Result   : Unsatisfiable 7.44s 7.62s
% Output   : Refutation 7.44s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :   12
% Syntax   : Number of clauses     :   25 (  13 unt;   0 nHn;  14 RR)
%            Number of literals    :   50 (  16 equ;  26 neg)
%            Maximal clause size   :    5 (   2 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   58 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(prove_both_equalities,negated_conjecture,
    ~ product(x,x,x),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_both_equalities) ).

cnf(reflexivity,axiom,
    X2 = X2,
    theory(equality) ).

cnf(closure_of_multiplication,axiom,
    product(X9,X10,multiply(X9,X10)),
    file('/export/starexec/sandbox/benchmark/Axioms/BOO002-0.ax',closure_of_multiplication) ).

cnf(commutativity_of_multiplication,axiom,
    ( ~ product(X23,X24,X25)
    | product(X24,X23,X25) ),
    file('/export/starexec/sandbox/benchmark/Axioms/BOO002-0.ax',commutativity_of_multiplication) ).

cnf(c13,plain,
    product(X39,X40,multiply(X40,X39)),
    inference(resolution,[status(thm)],[commutativity_of_multiplication,closure_of_multiplication]) ).

cnf(c4,axiom,
    ( X176 != X173
    | X171 != X172
    | X175 != X174
    | ~ product(X176,X171,X175)
    | product(X173,X172,X174) ),
    theory(equality) ).

cnf(c218,plain,
    ( X1067 != X1068
    | X1066 != X1065
    | multiply(X1066,X1067) != X1069
    | product(X1068,X1065,X1069) ),
    inference(resolution,[status(thm)],[c4,c13]) ).

cnf(symmetry,axiom,
    ( X20 != X21
    | X21 = X20 ),
    theory(equality) ).

cnf(additive_identity2,axiom,
    sum(X4,additive_identity,X4),
    file('/export/starexec/sandbox/benchmark/Axioms/BOO002-0.ax',additive_identity2) ).

cnf(addition_is_well_defined,axiom,
    ( ~ sum(X70,X71,X72)
    | ~ sum(X70,X71,X73)
    | X72 = X73 ),
    file('/export/starexec/sandbox/benchmark/Axioms/BOO002-0.ax',addition_is_well_defined) ).

cnf(c50,plain,
    ( ~ sum(X100,additive_identity,X101)
    | X101 = X100 ),
    inference(resolution,[status(thm)],[addition_is_well_defined,additive_identity2]) ).

cnf(multiplicative_inverse2,axiom,
    product(X14,inverse(X14),additive_identity),
    file('/export/starexec/sandbox/benchmark/Axioms/BOO002-0.ax',multiplicative_inverse2) ).

cnf(additive_inverse2,axiom,
    sum(X12,inverse(X12),multiplicative_identity),
    file('/export/starexec/sandbox/benchmark/Axioms/BOO002-0.ax',additive_inverse2) ).

cnf(multiplicative_identity2,axiom,
    product(X6,multiplicative_identity,X6),
    file('/export/starexec/sandbox/benchmark/Axioms/BOO002-0.ax',multiplicative_identity2) ).

cnf(distributivity1,axiom,
    ( ~ product(X35,X38,X32)
    | ~ product(X35,X37,X33)
    | ~ sum(X38,X37,X34)
    | ~ product(X35,X34,X36)
    | sum(X32,X33,X36) ),
    file('/export/starexec/sandbox/benchmark/Axioms/BOO002-0.ax',distributivity1) ).

cnf(c20,plain,
    ( ~ product(X222,X223,X219)
    | ~ product(X222,X221,X220)
    | ~ sum(X223,X221,multiplicative_identity)
    | sum(X219,X220,X222) ),
    inference(resolution,[status(thm)],[distributivity1,multiplicative_identity2]) ).

cnf(c256,plain,
    ( ~ product(X1175,X1174,X1173)
    | ~ product(X1175,inverse(X1174),X1176)
    | sum(X1173,X1176,X1175) ),
    inference(resolution,[status(thm)],[c20,additive_inverse2]) ).

cnf(c12483,plain,
    ( ~ product(X1179,X1179,X1178)
    | sum(X1178,additive_identity,X1179) ),
    inference(resolution,[status(thm)],[c256,multiplicative_inverse2]) ).

cnf(c12487,plain,
    sum(multiply(X1180,X1180),additive_identity,X1180),
    inference(resolution,[status(thm)],[c12483,closure_of_multiplication]) ).

cnf(c12499,plain,
    X1185 = multiply(X1185,X1185),
    inference(resolution,[status(thm)],[c12487,c50]) ).

cnf(c12562,plain,
    multiply(X1187,X1187) = X1187,
    inference(resolution,[status(thm)],[c12499,symmetry]) ).

cnf(c12622,plain,
    ( X1584 != X1585
    | X1584 != X1586
    | product(X1585,X1586,X1584) ),
    inference(resolution,[status(thm)],[c12562,c218]) ).

cnf(c22069,plain,
    ( X1591 != X1592
    | product(X1592,X1592,X1591) ),
    inference(factor,[status(thm)],[c12622]) ).

cnf(c22629,plain,
    product(X1593,X1593,X1593),
    inference(resolution,[status(thm)],[c22069,reflexivity]) ).

cnf(c22924,plain,
    $false,
    inference(resolution,[status(thm)],[c22629,prove_both_equalities]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : BOO003-1 : TPTP v8.1.2. Released v1.0.0.
% 0.07/0.13  % Command  : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% 0.13/0.35  % Computer : n004.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 300
% 0.13/0.35  % DateTime : Wed May  8 22:28:38 EDT 2024
% 0.13/0.35  % CPUTime  : 
% 7.44/7.62  % Version:  1.5
% 7.44/7.62  % SZS status Unsatisfiable
% 7.44/7.62  % SZS output start CNFRefutation
% See solution above
% 7.44/7.62  
% 7.44/7.62  % Initial clauses    : 31
% 7.44/7.62  % Processed clauses  : 546
% 7.44/7.62  % Factors computed   : 46
% 7.44/7.62  % Resolvents computed: 22874
% 7.44/7.62  % Tautologies deleted: 4
% 7.44/7.62  % Forward subsumed   : 754
% 7.44/7.62  % Backward subsumed  : 11
% 7.44/7.62  % -------- CPU Time ---------
% 7.44/7.62  % User time          : 7.211 s
% 7.44/7.62  % System time        : 0.053 s
% 7.44/7.62  % Total time         : 7.264 s
%------------------------------------------------------------------------------