%------------------------------------------------------------------------------
% File : PyRes---1.5
% Problem : GRP533-1 : TPTP v8.1.2. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% Computer : n032.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:23:59 EDT 2024
% Result : Unsatisfiable 41.97s 42.16s
% Output : Refutation 41.97s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 8
% Syntax : Number of clauses : 19 ( 12 unt; 0 nHn; 7 RR)
% Number of literals : 28 ( 27 equ; 10 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 1 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 : 36 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(prove_these_axioms_1,negated_conjecture,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms_1) ).
cnf(transitivity,axiom,
( X16 != X14
| X14 != X15
| X16 = X15 ),
theory(equality) ).
cnf(multiply,axiom,
multiply(X21,X22) = divide(X21,divide(divide(X20,X20),X22)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiply) ).
cnf(identity,axiom,
identity = divide(X3,X3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',identity) ).
cnf(symmetry,axiom,
( X5 != X4
| X4 = X5 ),
theory(equality) ).
cnf(c3,plain,
divide(X7,X7) = identity,
inference(resolution,[status(thm)],[symmetry,identity]) ).
cnf(c13,plain,
( X35 != divide(X36,X36)
| X35 = identity ),
inference(resolution,[status(thm)],[transitivity,c3]) ).
cnf(c31,plain,
multiply(divide(divide(X91,X91),X90),X90) = identity,
inference(resolution,[status(thm)],[c13,multiply]) ).
cnf(c117,plain,
( X624 != multiply(divide(divide(X625,X625),X623),X623)
| X624 = identity ),
inference(resolution,[status(thm)],[c31,transitivity]) ).
cnf(inverse,axiom,
inverse(X12) = divide(divide(X13,X13),X12),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',inverse) ).
cnf(reflexivity,axiom,
X2 = X2,
theory(equality) ).
cnf(c1,axiom,
( X50 != X47
| X48 != X49
| multiply(X50,X48) = multiply(X47,X49) ),
theory(equality) ).
cnf(c65,plain,
( X186 != X185
| multiply(X186,X184) = multiply(X185,X184) ),
inference(resolution,[status(thm)],[c1,reflexivity]) ).
cnf(c521,plain,
multiply(inverse(X3052),X3050) = multiply(divide(divide(X3051,X3051),X3052),X3050),
inference(resolution,[status(thm)],[c65,inverse]) ).
cnf(c66318,plain,
multiply(inverse(X3053),X3053) = identity,
inference(resolution,[status(thm)],[c521,c117]) ).
cnf(c66409,plain,
identity = multiply(inverse(X3054),X3054),
inference(resolution,[status(thm)],[c66318,symmetry]) ).
cnf(c66493,plain,
( X3133 != identity
| X3133 = multiply(inverse(X3134),X3134) ),
inference(resolution,[status(thm)],[c66409,transitivity]) ).
cnf(c68746,plain,
multiply(inverse(X3209),X3209) = multiply(inverse(X3208),X3208),
inference(resolution,[status(thm)],[c66493,c66318]) ).
cnf(c70323,plain,
$false,
inference(resolution,[status(thm)],[c68746,prove_these_axioms_1]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.08 % Problem : GRP533-1 : TPTP v8.1.2. Released v2.6.0.
% 0.04/0.09 % Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% 0.08/0.27 % Computer : n032.cluster.edu
% 0.08/0.27 % Model : x86_64 x86_64
% 0.08/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.27 % Memory : 8042.1875MB
% 0.08/0.27 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.27 % CPULimit : 300
% 0.08/0.27 % WCLimit : 300
% 0.08/0.27 % DateTime : Thu May 9 04:33:52 EDT 2024
% 0.08/0.27 % CPUTime :
% 41.97/42.16 % Version: 1.5
% 41.97/42.16 % SZS status Unsatisfiable
% 41.97/42.16 % SZS output start CNFRefutation
% See solution above
% 41.97/42.16
% 41.97/42.16 % Initial clauses : 11
% 41.97/42.16 % Processed clauses : 886
% 41.97/42.16 % Factors computed : 3
% 41.97/42.16 % Resolvents computed: 70360
% 41.97/42.16 % Tautologies deleted: 2
% 41.97/42.16 % Forward subsumed : 1406
% 41.97/42.16 % Backward subsumed : 12
% 41.97/42.16 % -------- CPU Time ---------
% 41.97/42.16 % User time : 41.703 s
% 41.97/42.16 % System time : 0.181 s
% 41.97/42.16 % Total time : 41.884 s
%------------------------------------------------------------------------------