TSTP Solution File: SEU090+1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : SEU090+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %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 : Wed May 31 12:35:48 EDT 2023
% Result : Theorem 0.12s 0.35s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 9
% Syntax : Number of formulae : 41 ( 12 unt; 0 def)
% Number of atoms : 96 ( 2 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 86 ( 31 ~; 29 |; 17 &)
% ( 5 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 6 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-4 aty)
% Number of variables : 39 (; 35 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f14,axiom,
! [A,B,C,D] : cartesian_product4(A,B,C,D) = cartesian_product2(cartesian_product3(A,B,C),D),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f17,axiom,
! [A,B] :
( ( finite(A)
& finite(B) )
=> finite(cartesian_product2(A,B)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f18,axiom,
! [A,B,C] :
( ( finite(A)
& finite(B)
& finite(C) )
=> finite(cartesian_product3(A,B,C)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f56,conjecture,
! [A,B,C,D] :
( ( finite(A)
& finite(B)
& finite(C)
& finite(D) )
=> finite(cartesian_product4(A,B,C,D)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f57,negated_conjecture,
~ ! [A,B,C,D] :
( ( finite(A)
& finite(B)
& finite(C)
& finite(D) )
=> finite(cartesian_product4(A,B,C,D)) ),
inference(negated_conjecture,[status(cth)],[f56]) ).
fof(f105,plain,
! [X0,X1,X2,X3] : cartesian_product4(X0,X1,X2,X3) = cartesian_product2(cartesian_product3(X0,X1,X2),X3),
inference(cnf_transformation,[status(esa)],[f14]) ).
fof(f111,plain,
! [A,B] :
( ~ finite(A)
| ~ finite(B)
| finite(cartesian_product2(A,B)) ),
inference(pre_NNF_transformation,[status(esa)],[f17]) ).
fof(f112,plain,
! [X0,X1] :
( ~ finite(X0)
| ~ finite(X1)
| finite(cartesian_product2(X0,X1)) ),
inference(cnf_transformation,[status(esa)],[f111]) ).
fof(f113,plain,
! [A,B,C] :
( ~ finite(A)
| ~ finite(B)
| ~ finite(C)
| finite(cartesian_product3(A,B,C)) ),
inference(pre_NNF_transformation,[status(esa)],[f18]) ).
fof(f114,plain,
! [X0,X1,X2] :
( ~ finite(X0)
| ~ finite(X1)
| ~ finite(X2)
| finite(cartesian_product3(X0,X1,X2)) ),
inference(cnf_transformation,[status(esa)],[f113]) ).
fof(f254,plain,
? [A,B,C,D] :
( finite(A)
& finite(B)
& finite(C)
& finite(D)
& ~ finite(cartesian_product4(A,B,C,D)) ),
inference(pre_NNF_transformation,[status(esa)],[f57]) ).
fof(f255,plain,
( finite(sk0_26)
& finite(sk0_27)
& finite(sk0_28)
& finite(sk0_29)
& ~ finite(cartesian_product4(sk0_26,sk0_27,sk0_28,sk0_29)) ),
inference(skolemization,[status(esa)],[f254]) ).
fof(f256,plain,
finite(sk0_26),
inference(cnf_transformation,[status(esa)],[f255]) ).
fof(f257,plain,
finite(sk0_27),
inference(cnf_transformation,[status(esa)],[f255]) ).
fof(f258,plain,
finite(sk0_28),
inference(cnf_transformation,[status(esa)],[f255]) ).
fof(f259,plain,
finite(sk0_29),
inference(cnf_transformation,[status(esa)],[f255]) ).
fof(f260,plain,
~ finite(cartesian_product4(sk0_26,sk0_27,sk0_28,sk0_29)),
inference(cnf_transformation,[status(esa)],[f255]) ).
fof(f612,plain,
! [X0,X1,X2,X3] :
( ~ finite(cartesian_product3(X0,X1,X2))
| ~ finite(X3)
| finite(cartesian_product4(X0,X1,X2,X3)) ),
inference(paramodulation,[status(thm)],[f105,f112]) ).
fof(f613,plain,
( spl0_56
<=> finite(cartesian_product3(sk0_26,sk0_27,sk0_28)) ),
introduced(split_symbol_definition) ).
fof(f615,plain,
( ~ finite(cartesian_product3(sk0_26,sk0_27,sk0_28))
| spl0_56 ),
inference(component_clause,[status(thm)],[f613]) ).
fof(f616,plain,
( spl0_57
<=> finite(sk0_29) ),
introduced(split_symbol_definition) ).
fof(f618,plain,
( ~ finite(sk0_29)
| spl0_57 ),
inference(component_clause,[status(thm)],[f616]) ).
fof(f619,plain,
( ~ finite(cartesian_product3(sk0_26,sk0_27,sk0_28))
| ~ finite(sk0_29) ),
inference(resolution,[status(thm)],[f612,f260]) ).
fof(f620,plain,
( ~ spl0_56
| ~ spl0_57 ),
inference(split_clause,[status(thm)],[f619,f613,f616]) ).
fof(f640,plain,
( spl0_58
<=> finite(sk0_26) ),
introduced(split_symbol_definition) ).
fof(f642,plain,
( ~ finite(sk0_26)
| spl0_58 ),
inference(component_clause,[status(thm)],[f640]) ).
fof(f643,plain,
( spl0_59
<=> finite(sk0_27) ),
introduced(split_symbol_definition) ).
fof(f645,plain,
( ~ finite(sk0_27)
| spl0_59 ),
inference(component_clause,[status(thm)],[f643]) ).
fof(f646,plain,
( spl0_60
<=> finite(sk0_28) ),
introduced(split_symbol_definition) ).
fof(f648,plain,
( ~ finite(sk0_28)
| spl0_60 ),
inference(component_clause,[status(thm)],[f646]) ).
fof(f649,plain,
( ~ finite(sk0_26)
| ~ finite(sk0_27)
| ~ finite(sk0_28)
| spl0_56 ),
inference(resolution,[status(thm)],[f615,f114]) ).
fof(f650,plain,
( ~ spl0_58
| ~ spl0_59
| ~ spl0_60
| spl0_56 ),
inference(split_clause,[status(thm)],[f649,f640,f643,f646,f613]) ).
fof(f651,plain,
( $false
| spl0_57 ),
inference(forward_subsumption_resolution,[status(thm)],[f618,f259]) ).
fof(f652,plain,
spl0_57,
inference(contradiction_clause,[status(thm)],[f651]) ).
fof(f653,plain,
( $false
| spl0_60 ),
inference(forward_subsumption_resolution,[status(thm)],[f648,f258]) ).
fof(f654,plain,
spl0_60,
inference(contradiction_clause,[status(thm)],[f653]) ).
fof(f655,plain,
( $false
| spl0_58 ),
inference(forward_subsumption_resolution,[status(thm)],[f642,f256]) ).
fof(f656,plain,
spl0_58,
inference(contradiction_clause,[status(thm)],[f655]) ).
fof(f657,plain,
( $false
| spl0_59 ),
inference(forward_subsumption_resolution,[status(thm)],[f645,f257]) ).
fof(f658,plain,
spl0_59,
inference(contradiction_clause,[status(thm)],[f657]) ).
fof(f659,plain,
$false,
inference(sat_refutation,[status(thm)],[f620,f650,f652,f654,f656,f658]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU090+1 : TPTP v8.1.2. Released v3.2.0.
% 0.07/0.12 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.12/0.33 % Computer : n007.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Tue May 30 08:58:17 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.12/0.35 % Drodi V3.5.1
% 0.12/0.35 % Refutation found
% 0.12/0.35 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.12/0.35 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.12/0.37 % Elapsed time: 0.027299 seconds
% 0.12/0.37 % CPU time: 0.049800 seconds
% 0.12/0.37 % Memory used: 17.404 MB
%------------------------------------------------------------------------------