TSTP Solution File: SYN334+1 by PyRes---1.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : PyRes---1.3
% Problem : SYN334+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% Computer : n024.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 : 600s
% DateTime : Thu Jul 21 11:27:14 EDT 2022
% Result : Theorem 0.20s 0.57s
% Output : Refutation 0.20s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named input)
% Comments :
%------------------------------------------------------------------------------
fof(church_46_14_6,conjecture,
? [X,Y] :
! [Z] :
( ( big_f(X,Y)
=> ( big_f(X,Z)
<=> big_g(Y,Z) ) )
=> ( ( big_f(X,Y)
<=> ( big_f(Z,Z)
=> big_g(Z,Z) ) )
=> ( big_g(X,Y)
<=> big_g(Z,Z) ) ) ),
input ).
fof(c0,negated_conjecture,
~ ? [X,Y] :
! [Z] :
( ( big_f(X,Y)
=> ( big_f(X,Z)
<=> big_g(Y,Z) ) )
=> ( ( big_f(X,Y)
<=> ( big_f(Z,Z)
=> big_g(Z,Z) ) )
=> ( big_g(X,Y)
<=> big_g(Z,Z) ) ) ),
inference(assume_negation,status(cth),[church_46_14_6]) ).
fof(c1,negated_conjecture,
! [X,Y] :
? [Z] :
( ( ~ big_f(X,Y)
| ( ( ~ big_f(X,Z)
| big_g(Y,Z) )
& ( ~ big_g(Y,Z)
| big_f(X,Z) ) ) )
& ( ~ big_f(X,Y)
| ~ big_f(Z,Z)
| big_g(Z,Z) )
& ( ( big_f(Z,Z)
& ~ big_g(Z,Z) )
| big_f(X,Y) )
& ( ~ big_g(X,Y)
| ~ big_g(Z,Z) )
& ( big_g(X,Y)
| big_g(Z,Z) ) ),
inference(fof_nnf,status(thm),[c0]) ).
fof(c2,negated_conjecture,
! [X2,X3] :
? [X4] :
( ( ~ big_f(X2,X3)
| ( ( ~ big_f(X2,X4)
| big_g(X3,X4) )
& ( ~ big_g(X3,X4)
| big_f(X2,X4) ) ) )
& ( ~ big_f(X2,X3)
| ~ big_f(X4,X4)
| big_g(X4,X4) )
& ( ( big_f(X4,X4)
& ~ big_g(X4,X4) )
| big_f(X2,X3) )
& ( ~ big_g(X2,X3)
| ~ big_g(X4,X4) )
& ( big_g(X2,X3)
| big_g(X4,X4) ) ),
inference(variable_rename,status(thm),[c1]) ).
fof(c3,negated_conjecture,
! [X2,X3] :
( ( ~ big_f(X2,X3)
| ( ( ~ big_f(X2,skolem0001(X2,X3))
| big_g(X3,skolem0001(X2,X3)) )
& ( ~ big_g(X3,skolem0001(X2,X3))
| big_f(X2,skolem0001(X2,X3)) ) ) )
& ( ~ big_f(X2,X3)
| ~ big_f(skolem0001(X2,X3),skolem0001(X2,X3))
| big_g(skolem0001(X2,X3),skolem0001(X2,X3)) )
& ( ( big_f(skolem0001(X2,X3),skolem0001(X2,X3))
& ~ big_g(skolem0001(X2,X3),skolem0001(X2,X3)) )
| big_f(X2,X3) )
& ( ~ big_g(X2,X3)
| ~ big_g(skolem0001(X2,X3),skolem0001(X2,X3)) )
& ( big_g(X2,X3)
| big_g(skolem0001(X2,X3),skolem0001(X2,X3)) ) ),
inference(skolemize,status(esa),[c2]) ).
fof(c4,negated_conjecture,
! [X2,X3] :
( ( ~ big_f(X2,X3)
| ~ big_f(X2,skolem0001(X2,X3))
| big_g(X3,skolem0001(X2,X3)) )
& ( ~ big_f(X2,X3)
| ~ big_g(X3,skolem0001(X2,X3))
| big_f(X2,skolem0001(X2,X3)) )
& ( ~ big_f(X2,X3)
| ~ big_f(skolem0001(X2,X3),skolem0001(X2,X3))
| big_g(skolem0001(X2,X3),skolem0001(X2,X3)) )
& ( big_f(skolem0001(X2,X3),skolem0001(X2,X3))
| big_f(X2,X3) )
& ( ~ big_g(skolem0001(X2,X3),skolem0001(X2,X3))
| big_f(X2,X3) )
& ( ~ big_g(X2,X3)
| ~ big_g(skolem0001(X2,X3),skolem0001(X2,X3)) )
& ( big_g(X2,X3)
| big_g(skolem0001(X2,X3),skolem0001(X2,X3)) ) ),
inference(distribute,status(thm),[c3]) ).
cnf(c9,negated_conjecture,
( ~ big_g(skolem0001(X7,X8),skolem0001(X7,X8))
| big_f(X7,X8) ),
inference(split_conjunct,status(thm),[c4]) ).
cnf(c11,negated_conjecture,
( big_g(X11,X12)
| big_g(skolem0001(X11,X12),skolem0001(X11,X12)) ),
inference(split_conjunct,status(thm),[c4]) ).
cnf(c14,plain,
( big_g(X13,X14)
| big_f(X13,X14) ),
inference(resolution,status(thm),[c11,c9]) ).
cnf(c5,negated_conjecture,
( ~ big_f(X15,X16)
| ~ big_f(X15,skolem0001(X15,X16))
| big_g(X16,skolem0001(X15,X16)) ),
inference(split_conjunct,status(thm),[c4]) ).
cnf(c18,plain,
( ~ big_f(X33,X34)
| big_g(X34,skolem0001(X33,X34))
| big_g(X33,skolem0001(X33,X34)) ),
inference(resolution,status(thm),[c5,c14]) ).
cnf(c31,plain,
( big_g(X45,skolem0001(X46,X45))
| big_g(X46,skolem0001(X46,X45))
| big_g(X46,X45) ),
inference(resolution,status(thm),[c18,c14]) ).
cnf(c44,plain,
( big_g(X47,skolem0001(X47,X47))
| big_g(X47,X47) ),
inference(factor,status(thm),[c31]) ).
cnf(c10,negated_conjecture,
( ~ big_g(X9,X10)
| ~ big_g(skolem0001(X9,X10),skolem0001(X9,X10)) ),
inference(split_conjunct,status(thm),[c4]) ).
cnf(c7,negated_conjecture,
( ~ big_f(X27,X28)
| ~ big_f(skolem0001(X27,X28),skolem0001(X27,X28))
| big_g(skolem0001(X27,X28),skolem0001(X27,X28)) ),
inference(split_conjunct,status(thm),[c4]) ).
cnf(c25,plain,
( ~ big_f(X30,X29)
| big_g(skolem0001(X30,X29),skolem0001(X30,X29)) ),
inference(resolution,status(thm),[c7,c14]) ).
cnf(c6,negated_conjecture,
( ~ big_f(X25,X26)
| ~ big_g(X26,skolem0001(X25,X26))
| big_f(X25,skolem0001(X25,X26)) ),
inference(split_conjunct,status(thm),[c4]) ).
cnf(c53,plain,
( big_g(X48,X48)
| ~ big_f(X48,X48)
| big_f(X48,skolem0001(X48,X48)) ),
inference(resolution,status(thm),[c44,c6]) ).
cnf(c58,plain,
( big_g(X51,X51)
| big_f(X51,skolem0001(X51,X51)) ),
inference(resolution,status(thm),[c53,c14]) ).
cnf(c75,plain,
( big_g(X85,X85)
| big_g(skolem0001(X85,skolem0001(X85,X85)),skolem0001(X85,skolem0001(X85,X85))) ),
inference(resolution,status(thm),[c58,c25]) ).
cnf(c205,plain,
( big_g(X87,X87)
| ~ big_g(X87,skolem0001(X87,X87)) ),
inference(resolution,status(thm),[c75,c10]) ).
cnf(c210,plain,
big_g(X90,X90),
inference(resolution,status(thm),[c205,c44]) ).
cnf(c220,plain,
~ big_g(X94,X93),
inference(resolution,status(thm),[c210,c10]) ).
cnf(c226,plain,
$false,
inference(resolution,status(thm),[c220,c210]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SYN334+1 : TPTP v8.1.0. Released v2.0.0.
% 0.11/0.13 % Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% 0.13/0.33 % Computer : n024.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Mon Jul 11 20:24:43 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.57 # Version: 1.3
% 0.20/0.57 # SZS status Theorem
% 0.20/0.57 # SZS output start CNFRefutation
% See solution above
% 0.20/0.57
% 0.20/0.57 # Initial clauses : 7
% 0.20/0.57 # Processed clauses : 34
% 0.20/0.57 # Factors computed : 2
% 0.20/0.57 # Resolvents computed: 215
% 0.20/0.57 # Tautologies deleted: 2
% 0.20/0.57 # Forward subsumed : 15
% 0.20/0.57 # Backward subsumed : 28
% 0.20/0.57 # -------- CPU Time ---------
% 0.20/0.57 # User time : 0.211 s
% 0.20/0.57 # System time : 0.017 s
% 0.20/0.57 # Total time : 0.228 s
%------------------------------------------------------------------------------