%------------------------------------------------------------------------------
% File : PyRes---1.5
% Problem : SYN328+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% Computer : n007.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:47:54 EDT 2024
% Result : Theorem 0.22s 0.56s
% Output : Refutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 1
% Syntax : Number of formulae : 27 ( 5 unt; 0 def)
% Number of atoms : 185 ( 0 equ)
% Maximal formula atoms : 28 ( 6 avg)
% Number of connectives : 238 ( 80 ~; 84 |; 54 &)
% ( 6 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 0 con; 1-1 aty)
% Number of variables : 40 ( 4 sgn 9 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(church_46_12_3,conjecture,
? [X] :
! [Y,Z] :
( ( ( big_f(Y)
=> big_g(Y) )
<=> big_f(X) )
=> ( ( ( big_f(Y)
=> big_h(Y) )
<=> big_g(X) )
=> ( ( ( ( big_f(Y)
=> big_g(Y) )
=> big_h(Y) )
<=> big_h(X) )
=> ( big_f(Z)
& big_g(Z)
& big_h(Z) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',church_46_12_3) ).
fof(c0,negated_conjecture,
~ ? [X] :
! [Y,Z] :
( ( ( big_f(Y)
=> big_g(Y) )
<=> big_f(X) )
=> ( ( ( big_f(Y)
=> big_h(Y) )
<=> big_g(X) )
=> ( ( ( ( big_f(Y)
=> big_g(Y) )
=> big_h(Y) )
<=> big_h(X) )
=> ( big_f(Z)
& big_g(Z)
& big_h(Z) ) ) ) ),
inference(assume_negation,[status(cth)],[church_46_12_3]) ).
fof(c1,negated_conjecture,
! [X] :
? [Y,Z] :
( ( ( big_f(Y)
& ~ big_g(Y) )
| big_f(X) )
& ( ~ big_f(X)
| ~ big_f(Y)
| big_g(Y) )
& ( ( big_f(Y)
& ~ big_h(Y) )
| big_g(X) )
& ( ~ big_g(X)
| ~ big_f(Y)
| big_h(Y) )
& ( ( ( ~ big_f(Y)
| big_g(Y) )
& ~ big_h(Y) )
| big_h(X) )
& ( ~ big_h(X)
| ( big_f(Y)
& ~ big_g(Y) )
| big_h(Y) )
& ( ~ big_f(Z)
| ~ big_g(Z)
| ~ big_h(Z) ) ),
inference(fof_nnf,[status(thm)],[c0]) ).
fof(c2,negated_conjecture,
! [X] :
? [Y] :
( ( ( big_f(Y)
& ~ big_g(Y) )
| big_f(X) )
& ( ~ big_f(X)
| ~ big_f(Y)
| big_g(Y) )
& ( ( big_f(Y)
& ~ big_h(Y) )
| big_g(X) )
& ( ~ big_g(X)
| ~ big_f(Y)
| big_h(Y) )
& ( ( ( ~ big_f(Y)
| big_g(Y) )
& ~ big_h(Y) )
| big_h(X) )
& ( ~ big_h(X)
| ( big_f(Y)
& ~ big_g(Y) )
| big_h(Y) )
& ( ? [Z] : ~ big_f(Z)
| ? [Z] : ~ big_g(Z)
| ? [Z] : ~ big_h(Z) ) ),
inference(shift_quantors,[status(thm)],[c1]) ).
fof(c3,negated_conjecture,
! [X2] :
? [X3] :
( ( ( big_f(X3)
& ~ big_g(X3) )
| big_f(X2) )
& ( ~ big_f(X2)
| ~ big_f(X3)
| big_g(X3) )
& ( ( big_f(X3)
& ~ big_h(X3) )
| big_g(X2) )
& ( ~ big_g(X2)
| ~ big_f(X3)
| big_h(X3) )
& ( ( ( ~ big_f(X3)
| big_g(X3) )
& ~ big_h(X3) )
| big_h(X2) )
& ( ~ big_h(X2)
| ( big_f(X3)
& ~ big_g(X3) )
| big_h(X3) )
& ( ? [X4] : ~ big_f(X4)
| ? [X5] : ~ big_g(X5)
| ? [X6] : ~ big_h(X6) ) ),
inference(variable_rename,[status(thm)],[c2]) ).
fof(c4,negated_conjecture,
! [X2] :
( ( ( big_f(skolem0001(X2))
& ~ big_g(skolem0001(X2)) )
| big_f(X2) )
& ( ~ big_f(X2)
| ~ big_f(skolem0001(X2))
| big_g(skolem0001(X2)) )
& ( ( big_f(skolem0001(X2))
& ~ big_h(skolem0001(X2)) )
| big_g(X2) )
& ( ~ big_g(X2)
| ~ big_f(skolem0001(X2))
| big_h(skolem0001(X2)) )
& ( ( ( ~ big_f(skolem0001(X2))
| big_g(skolem0001(X2)) )
& ~ big_h(skolem0001(X2)) )
| big_h(X2) )
& ( ~ big_h(X2)
| ( big_f(skolem0001(X2))
& ~ big_g(skolem0001(X2)) )
| big_h(skolem0001(X2)) )
& ( ~ big_f(skolem0002(X2))
| ~ big_g(skolem0003(X2))
| ~ big_h(skolem0004(X2)) ) ),
inference(skolemize,[status(esa)],[c3]) ).
fof(c5,negated_conjecture,
! [X2] :
( ( big_f(skolem0001(X2))
| big_f(X2) )
& ( ~ big_g(skolem0001(X2))
| big_f(X2) )
& ( ~ big_f(X2)
| ~ big_f(skolem0001(X2))
| big_g(skolem0001(X2)) )
& ( big_f(skolem0001(X2))
| big_g(X2) )
& ( ~ big_h(skolem0001(X2))
| big_g(X2) )
& ( ~ big_g(X2)
| ~ big_f(skolem0001(X2))
| big_h(skolem0001(X2)) )
& ( ~ big_f(skolem0001(X2))
| big_g(skolem0001(X2))
| big_h(X2) )
& ( ~ big_h(skolem0001(X2))
| big_h(X2) )
& ( ~ big_h(X2)
| big_f(skolem0001(X2))
| big_h(skolem0001(X2)) )
& ( ~ big_h(X2)
| ~ big_g(skolem0001(X2))
| big_h(skolem0001(X2)) )
& ( ~ big_f(skolem0002(X2))
| ~ big_g(skolem0003(X2))
| ~ big_h(skolem0004(X2)) ) ),
inference(distribute,[status(thm)],[c4]) ).
cnf(c7,negated_conjecture,
( ~ big_g(skolem0001(X8))
| big_f(X8) ),
inference(split_conjunct,[status(thm)],[c5]) ).
cnf(c10,negated_conjecture,
( ~ big_h(skolem0001(X10))
| big_g(X10) ),
inference(split_conjunct,[status(thm)],[c5]) ).
cnf(c13,negated_conjecture,
( ~ big_h(skolem0001(X11))
| big_h(X11) ),
inference(split_conjunct,[status(thm)],[c5]) ).
cnf(c11,negated_conjecture,
( ~ big_g(X16)
| ~ big_f(skolem0001(X16))
| big_h(skolem0001(X16)) ),
inference(split_conjunct,[status(thm)],[c5]) ).
cnf(c6,negated_conjecture,
( big_f(skolem0001(X7))
| big_f(X7) ),
inference(split_conjunct,[status(thm)],[c5]) ).
cnf(c12,negated_conjecture,
( ~ big_f(skolem0001(X18))
| big_g(skolem0001(X18))
| big_h(X18) ),
inference(split_conjunct,[status(thm)],[c5]) ).
cnf(c34,plain,
( big_g(skolem0001(X20))
| big_h(X20)
| big_f(X20) ),
inference(resolution,[status(thm)],[c12,c6]) ).
cnf(c40,plain,
( big_h(X21)
| big_f(X21) ),
inference(resolution,[status(thm)],[c34,c7]) ).
cnf(c52,plain,
( big_h(skolem0001(X25))
| ~ big_g(X25) ),
inference(resolution,[status(thm)],[c40,c11]) ).
cnf(c47,plain,
( big_f(skolem0001(X22))
| big_h(X22) ),
inference(resolution,[status(thm)],[c40,c13]) ).
cnf(c55,plain,
( big_h(X26)
| big_g(skolem0001(X26)) ),
inference(resolution,[status(thm)],[c47,c12]) ).
cnf(c62,plain,
( big_h(X37)
| big_h(skolem0001(skolem0001(X37))) ),
inference(resolution,[status(thm)],[c55,c52]) ).
cnf(c94,plain,
( big_h(X38)
| big_h(skolem0001(X38)) ),
inference(resolution,[status(thm)],[c62,c13]) ).
cnf(c99,plain,
big_h(X39),
inference(resolution,[status(thm)],[c94,c13]) ).
cnf(c102,plain,
big_g(X40),
inference(resolution,[status(thm)],[c99,c10]) ).
cnf(c103,plain,
big_f(X41),
inference(resolution,[status(thm)],[c102,c7]) ).
cnf(c16,negated_conjecture,
( ~ big_f(skolem0002(X36))
| ~ big_g(skolem0003(X36))
| ~ big_h(skolem0004(X36)) ),
inference(split_conjunct,[status(thm)],[c5]) ).
cnf(c101,plain,
( ~ big_f(skolem0002(X47))
| ~ big_g(skolem0003(X47)) ),
inference(resolution,[status(thm)],[c99,c16]) ).
cnf(c104,plain,
~ big_f(skolem0002(X49)),
inference(resolution,[status(thm)],[c101,c102]) ).
cnf(c105,plain,
$false,
inference(resolution,[status(thm)],[c104,c103]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SYN328+1 : TPTP v8.1.2. Released v2.0.0.
% 0.08/0.14 % Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% 0.14/0.36 % Computer : n007.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Wed May 8 20:30:23 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.22/0.56 % Version: 1.5
% 0.22/0.56 % SZS status Theorem
% 0.22/0.56 % SZS output start CNFRefutation
% See solution above
% 0.22/0.56
% 0.22/0.56 % Initial clauses : 11
% 0.22/0.56 % Processed clauses : 29
% 0.22/0.56 % Factors computed : 0
% 0.22/0.56 % Resolvents computed: 89
% 0.22/0.56 % Tautologies deleted: 2
% 0.22/0.56 % Forward subsumed : 12
% 0.22/0.56 % Backward subsumed : 25
% 0.22/0.56 % -------- CPU Time ---------
% 0.22/0.56 % User time : 0.177 s
% 0.22/0.56 % System time : 0.017 s
% 0.22/0.56 % Total time : 0.194 s
%------------------------------------------------------------------------------