%------------------------------------------------------------------------------
% File : PyRes---1.5
% Problem : GRP457-1 : TPTP v8.1.2. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% Computer : n010.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:51 EDT 2024
% Result : Unsatisfiable 4.79s 4.97s
% Output : Refutation 4.79s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of clauses : 20 ( 14 unt; 0 nHn; 7 RR)
% Number of literals : 28 ( 27 equ; 9 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 32 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(prove_these_axioms_1,negated_conjecture,
multiply(inverse(a1),a1) != identity,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms_1) ).
cnf(symmetry,axiom,
( X4 != X5
| X5 = X4 ),
theory(equality) ).
cnf(transitivity,axiom,
( X17 != X18
| X18 != X19
| X17 = X19 ),
theory(equality) ).
cnf(multiply,axiom,
multiply(X16,X15) = divide(X16,divide(identity,X15)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiply) ).
cnf(c9,plain,
divide(X51,divide(identity,X52)) = multiply(X51,X52),
inference(resolution,[status(thm)],[multiply,symmetry]) ).
cnf(c82,plain,
( X337 != divide(X336,divide(identity,X338))
| X337 = multiply(X336,X338) ),
inference(resolution,[status(thm)],[c9,transitivity]) ).
cnf(identity,axiom,
identity = divide(X3,X3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',identity) ).
cnf(c4,plain,
divide(X7,X7) = identity,
inference(resolution,[status(thm)],[symmetry,identity]) ).
cnf(c11,plain,
( X30 != divide(X31,X31)
| X30 = identity ),
inference(resolution,[status(thm)],[transitivity,c4]) ).
cnf(reflexivity,axiom,
X2 = X2,
theory(equality) ).
cnf(inverse,axiom,
inverse(X12) = divide(identity,X12),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',inverse) ).
cnf(c7,plain,
divide(identity,X13) = inverse(X13),
inference(resolution,[status(thm)],[inverse,symmetry]) ).
cnf(c0,axiom,
( X26 != X29
| X28 != X27
| divide(X26,X28) = divide(X29,X27) ),
theory(equality) ).
cnf(c27,plain,
( X115 != X113
| divide(X115,divide(identity,X114)) = divide(X113,inverse(X114)) ),
inference(resolution,[status(thm)],[c0,c7]) ).
cnf(c298,plain,
divide(X929,divide(identity,X928)) = divide(X929,inverse(X928)),
inference(resolution,[status(thm)],[c27,reflexivity]) ).
cnf(c15570,plain,
divide(inverse(X932),divide(identity,X932)) = identity,
inference(resolution,[status(thm)],[c298,c11]) ).
cnf(c15693,plain,
identity = divide(inverse(X933),divide(identity,X933)),
inference(resolution,[status(thm)],[c15570,symmetry]) ).
cnf(c15810,plain,
identity = multiply(inverse(X934),X934),
inference(resolution,[status(thm)],[c15693,c82]) ).
cnf(c15849,plain,
multiply(inverse(X935),X935) = identity,
inference(resolution,[status(thm)],[c15810,symmetry]) ).
cnf(c15958,plain,
$false,
inference(resolution,[status(thm)],[c15849,prove_these_axioms_1]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : GRP457-1 : TPTP v8.1.2. Released v2.6.0.
% 0.07/0.13 % Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% 0.14/0.34 % Computer : n010.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % 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 : Thu May 9 03:36:38 EDT 2024
% 0.14/0.35 % CPUTime :
% 4.79/4.97 % Version: 1.5
% 4.79/4.97 % SZS status Unsatisfiable
% 4.79/4.97 % SZS output start CNFRefutation
% See solution above
% 4.79/4.97
% 4.79/4.97 % Initial clauses : 11
% 4.79/4.97 % Processed clauses : 311
% 4.79/4.97 % Factors computed : 3
% 4.79/4.97 % Resolvents computed: 15979
% 4.79/4.97 % Tautologies deleted: 2
% 4.79/4.97 % Forward subsumed : 501
% 4.79/4.97 % Backward subsumed : 3
% 4.79/4.97 % -------- CPU Time ---------
% 4.79/4.97 % User time : 4.581 s
% 4.79/4.97 % System time : 0.037 s
% 4.79/4.97 % Total time : 4.618 s
%------------------------------------------------------------------------------