%------------------------------------------------------------------------------
% File : PyRes---1.5
% Problem : COL051-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% Computer : n015.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:17:21 EDT 2024
% Result : Unsatisfiable 0.92s 1.16s
% Output : Refutation 0.92s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of clauses : 17 ( 11 unt; 0 nHn; 7 RR)
% Number of literals : 25 ( 24 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 : 3 ( 3 usr; 1 con; 0-2 aty)
% Number of variables : 36 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(prove_the_bird_exists,negated_conjecture,
response(X3,X3) != X3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_the_bird_exists) ).
cnf(symmetry,axiom,
( X4 != X5
| X5 = X4 ),
theory(equality) ).
cnf(mocking_bird_exists,axiom,
response(mocking_bird,X7) = response(X7,X7),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mocking_bird_exists) ).
cnf(c3,plain,
response(X11,X11) = response(mocking_bird,X11),
inference(resolution,[status(thm)],[mocking_bird_exists,symmetry]) ).
cnf(transitivity,axiom,
( X13 != X15
| X15 != X14
| X13 = X14 ),
theory(equality) ).
cnf(reflexivity,axiom,
X2 = X2,
theory(equality) ).
cnf(c0,axiom,
( X21 != X20
| X22 != X19
| response(X21,X22) = response(X20,X19) ),
theory(equality) ).
cnf(c12,plain,
( X69 != X71
| response(X69,response(mocking_bird,X70)) = response(X71,response(X70,X70)) ),
inference(resolution,[status(thm)],[c0,mocking_bird_exists]) ).
cnf(c72,plain,
response(X81,response(mocking_bird,X80)) = response(X81,response(X80,X80)),
inference(resolution,[status(thm)],[c12,reflexivity]) ).
cnf(c106,plain,
response(X91,response(X92,X92)) = response(X91,response(mocking_bird,X92)),
inference(resolution,[status(thm)],[c72,symmetry]) ).
cnf(composer_exists,plain,
response(compose(X8,X10),X9) = response(X8,response(X10,X9)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',composer_exists) ).
cnf(c4,plain,
response(X43,response(X42,X44)) = response(compose(X43,X42),X44),
inference(resolution,[status(thm)],[composer_exists,symmetry]) ).
cnf(c40,plain,
( X107 != response(X108,response(X106,X109))
| X107 = response(compose(X108,X106),X109) ),
inference(resolution,[status(thm)],[c4,transitivity]) ).
cnf(c160,plain,
response(X118,response(X117,X117)) = response(compose(X118,mocking_bird),X117),
inference(resolution,[status(thm)],[c40,c106]) ).
cnf(c192,plain,
( X300 != response(X301,response(X299,X299))
| X300 = response(compose(X301,mocking_bird),X299) ),
inference(resolution,[status(thm)],[c160,transitivity]) ).
cnf(c848,plain,
response(response(X465,X465),response(X465,X465)) = response(compose(mocking_bird,mocking_bird),X465),
inference(resolution,[status(thm)],[c192,c3]) ).
cnf(c1669,plain,
$false,
inference(resolution,[status(thm)],[c848,prove_the_bird_exists]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : COL051-1 : TPTP v8.1.2. Released v1.0.0.
% 0.07/0.14 % Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% 0.14/0.35 % Computer : n015.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Wed May 8 21:45:53 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.92/1.16 % Version: 1.5
% 0.92/1.16 % SZS status Unsatisfiable
% 0.92/1.16 % SZS output start CNFRefutation
% See solution above
% 0.92/1.16
% 0.92/1.16 % Initial clauses : 8
% 0.92/1.16 % Processed clauses : 103
% 0.92/1.16 % Factors computed : 3
% 0.92/1.16 % Resolvents computed: 1709
% 0.92/1.16 % Tautologies deleted: 2
% 0.92/1.16 % Forward subsumed : 129
% 0.92/1.16 % Backward subsumed : 1
% 0.92/1.16 % -------- CPU Time ---------
% 0.92/1.16 % User time : 0.779 s
% 0.92/1.16 % System time : 0.013 s
% 0.92/1.16 % Total time : 0.793 s
%------------------------------------------------------------------------------