TSTP Solution File: SYN074+1 by Drodi---3.6.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.6.0
% Problem : SYN074+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %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 : Tue Apr 30 20:51:15 EDT 2024
% Result : Theorem 0.09s 0.30s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 6
% Syntax : Number of formulae : 45 ( 7 unt; 0 def)
% Number of atoms : 131 ( 73 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 138 ( 52 ~; 59 |; 16 &)
% ( 10 <=>; 0 =>; 0 <=; 1 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 5 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 67 ( 49 !; 18 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
? [Z,W] :
! [X,Y] :
( big_f(X,Y)
<=> ( X = Z
& Y = W ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f2,conjecture,
? [Z] :
! [X] :
( ? [W] :
! [Y] :
( big_f(X,Y)
<=> Y = W )
<=> X = Z ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f3,negated_conjecture,
~ ? [Z] :
! [X] :
( ? [W] :
! [Y] :
( big_f(X,Y)
<=> Y = W )
<=> X = Z ),
inference(negated_conjecture,[status(cth)],[f2]) ).
fof(f4,plain,
? [Z,W] :
! [X,Y] :
( ( ~ big_f(X,Y)
| ( X = Z
& Y = W ) )
& ( big_f(X,Y)
| X != Z
| Y != W ) ),
inference(NNF_transformation,[status(esa)],[f1]) ).
fof(f5,plain,
? [Z,W] :
( ! [X,Y] :
( ~ big_f(X,Y)
| ( X = Z
& Y = W ) )
& ! [X,Y] :
( big_f(X,Y)
| X != Z
| Y != W ) ),
inference(miniscoping,[status(esa)],[f4]) ).
fof(f6,plain,
( ! [X,Y] :
( ~ big_f(X,Y)
| ( X = sk0_0
& Y = sk0_1 ) )
& ! [X,Y] :
( big_f(X,Y)
| X != sk0_0
| Y != sk0_1 ) ),
inference(skolemization,[status(esa)],[f5]) ).
fof(f7,plain,
! [X0,X1] :
( ~ big_f(X0,X1)
| X0 = sk0_0 ),
inference(cnf_transformation,[status(esa)],[f6]) ).
fof(f8,plain,
! [X0,X1] :
( ~ big_f(X0,X1)
| X1 = sk0_1 ),
inference(cnf_transformation,[status(esa)],[f6]) ).
fof(f9,plain,
! [X0,X1] :
( big_f(X0,X1)
| X0 != sk0_0
| X1 != sk0_1 ),
inference(cnf_transformation,[status(esa)],[f6]) ).
fof(f10,plain,
! [Z] :
? [X] :
( ? [W] :
! [Y] :
( big_f(X,Y)
<=> Y = W )
<~> X = Z ),
inference(pre_NNF_transformation,[status(esa)],[f3]) ).
fof(f11,plain,
! [Z] :
? [X] :
( ( ? [W] :
! [Y] :
( ( ~ big_f(X,Y)
| Y = W )
& ( big_f(X,Y)
| Y != W ) )
| X = Z )
& ( ! [W] :
? [Y] :
( ( ~ big_f(X,Y)
| Y != W )
& ( big_f(X,Y)
| Y = W ) )
| X != Z ) ),
inference(NNF_transformation,[status(esa)],[f10]) ).
fof(f12,plain,
! [Z] :
? [X] :
( ( ? [W] :
( ! [Y] :
( ~ big_f(X,Y)
| Y = W )
& ! [Y] :
( big_f(X,Y)
| Y != W ) )
| X = Z )
& ( ! [W] :
? [Y] :
( ( ~ big_f(X,Y)
| Y != W )
& ( big_f(X,Y)
| Y = W ) )
| X != Z ) ),
inference(miniscoping,[status(esa)],[f11]) ).
fof(f13,plain,
! [Z] :
( ( ( ! [Y] :
( ~ big_f(sk0_2(Z),Y)
| Y = sk0_3(Z) )
& ! [Y] :
( big_f(sk0_2(Z),Y)
| Y != sk0_3(Z) ) )
| sk0_2(Z) = Z )
& ( ! [W] :
( ( ~ big_f(sk0_2(Z),sk0_4(W,Z))
| sk0_4(W,Z) != W )
& ( big_f(sk0_2(Z),sk0_4(W,Z))
| sk0_4(W,Z) = W ) )
| sk0_2(Z) != Z ) ),
inference(skolemization,[status(esa)],[f12]) ).
fof(f15,plain,
! [X0,X1] :
( big_f(sk0_2(X0),X1)
| X1 != sk0_3(X0)
| sk0_2(X0) = X0 ),
inference(cnf_transformation,[status(esa)],[f13]) ).
fof(f16,plain,
! [X0,X1] :
( ~ big_f(sk0_2(X0),sk0_4(X1,X0))
| sk0_4(X1,X0) != X1
| sk0_2(X0) != X0 ),
inference(cnf_transformation,[status(esa)],[f13]) ).
fof(f17,plain,
! [X0,X1] :
( big_f(sk0_2(X0),sk0_4(X1,X0))
| sk0_4(X1,X0) = X1
| sk0_2(X0) != X0 ),
inference(cnf_transformation,[status(esa)],[f13]) ).
fof(f18,plain,
big_f(sk0_0,sk0_1),
inference(destructive_equality_resolution,[status(esa)],[f9]) ).
fof(f19,plain,
! [X0] :
( big_f(sk0_2(X0),sk0_3(X0))
| sk0_2(X0) = X0 ),
inference(destructive_equality_resolution,[status(esa)],[f15]) ).
fof(f21,plain,
! [X0] :
( sk0_2(X0) = sk0_0
| sk0_2(X0) = X0 ),
inference(resolution,[status(thm)],[f7,f19]) ).
fof(f34,plain,
! [X0] :
( sk0_0 != X0
| sk0_2(X0) = X0 ),
inference(equality_factoring,[status(esa)],[f21]) ).
fof(f35,plain,
sk0_2(sk0_0) = sk0_0,
inference(destructive_equality_resolution,[status(esa)],[f34]) ).
fof(f39,plain,
( spl0_0
<=> sk0_0 = sk0_0 ),
introduced(split_symbol_definition) ).
fof(f41,plain,
( sk0_0 != sk0_0
| spl0_0 ),
inference(component_clause,[status(thm)],[f39]) ).
fof(f42,plain,
( spl0_1
<=> sk0_2(sk0_0) = sk0_0 ),
introduced(split_symbol_definition) ).
fof(f44,plain,
( sk0_2(sk0_0) != sk0_0
| spl0_1 ),
inference(component_clause,[status(thm)],[f42]) ).
fof(f110,plain,
( sk0_0 != sk0_0
| spl0_1 ),
inference(forward_demodulation,[status(thm)],[f35,f44]) ).
fof(f111,plain,
( $false
| spl0_1 ),
inference(trivial_equality_resolution,[status(esa)],[f110]) ).
fof(f112,plain,
spl0_1,
inference(contradiction_clause,[status(thm)],[f111]) ).
fof(f156,plain,
! [X0,X1] :
( sk0_4(X0,X1) = sk0_1
| sk0_4(X0,X1) = X0
| sk0_2(X1) != X1 ),
inference(resolution,[status(thm)],[f8,f17]) ).
fof(f187,plain,
! [X0,X1] :
( sk0_2(X0) != X0
| X1 != sk0_1
| sk0_4(X1,X0) = sk0_1 ),
inference(equality_factoring,[status(esa)],[f156]) ).
fof(f188,plain,
! [X0] :
( sk0_2(X0) != X0
| sk0_4(sk0_1,X0) = sk0_1 ),
inference(destructive_equality_resolution,[status(esa)],[f187]) ).
fof(f189,plain,
sk0_4(sk0_1,sk0_0) = sk0_1,
inference(resolution,[status(thm)],[f188,f35]) ).
fof(f191,plain,
( spl0_16
<=> sk0_4(sk0_1,sk0_0) = sk0_1 ),
introduced(split_symbol_definition) ).
fof(f200,plain,
( sk0_0 != sk0_0
| sk0_4(sk0_1,sk0_0) = sk0_1 ),
inference(paramodulation,[status(thm)],[f35,f188]) ).
fof(f201,plain,
( ~ spl0_0
| spl0_16 ),
inference(split_clause,[status(thm)],[f200,f39,f191]) ).
fof(f206,plain,
( $false
| spl0_0 ),
inference(trivial_equality_resolution,[status(esa)],[f41]) ).
fof(f207,plain,
spl0_0,
inference(contradiction_clause,[status(thm)],[f206]) ).
fof(f214,plain,
( spl0_17
<=> big_f(sk0_2(sk0_0),sk0_1) ),
introduced(split_symbol_definition) ).
fof(f216,plain,
( ~ big_f(sk0_2(sk0_0),sk0_1)
| spl0_17 ),
inference(component_clause,[status(thm)],[f214]) ).
fof(f219,plain,
( ~ big_f(sk0_2(sk0_0),sk0_1)
| sk0_4(sk0_1,sk0_0) != sk0_1
| sk0_2(sk0_0) != sk0_0 ),
inference(paramodulation,[status(thm)],[f189,f16]) ).
fof(f220,plain,
( ~ spl0_17
| ~ spl0_16
| ~ spl0_1 ),
inference(split_clause,[status(thm)],[f219,f214,f191,f42]) ).
fof(f221,plain,
( ~ big_f(sk0_0,sk0_1)
| spl0_17 ),
inference(forward_demodulation,[status(thm)],[f35,f216]) ).
fof(f222,plain,
( $false
| spl0_17 ),
inference(forward_subsumption_resolution,[status(thm)],[f221,f18]) ).
fof(f223,plain,
spl0_17,
inference(contradiction_clause,[status(thm)],[f222]) ).
fof(f224,plain,
$false,
inference(sat_refutation,[status(thm)],[f112,f201,f207,f220,f223]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.09 % Problem : SYN074+1 : TPTP v8.1.2. Released v2.0.0.
% 0.08/0.09 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.09/0.29 % Computer : n010.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29 % CPULimit : 300
% 0.09/0.29 % WCLimit : 300
% 0.09/0.29 % DateTime : Mon Apr 29 21:44:20 EDT 2024
% 0.09/0.29 % CPUTime :
% 0.09/0.30 % Drodi V3.6.0
% 0.09/0.30 % Refutation found
% 0.09/0.30 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.09/0.30 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.14/0.32 % Elapsed time: 0.014859 seconds
% 0.14/0.32 % CPU time: 0.027253 seconds
% 0.14/0.32 % Total memory used: 11.162 MB
% 0.14/0.32 % Net memory used: 11.145 MB
%------------------------------------------------------------------------------