TSTP Solution File: SEU090+1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SEU090+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n020.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 15:22:06 EDT 2024
% Result : Theorem 0.17s 0.41s
% Output : Refutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 5
% Syntax : Number of formulae : 28 ( 9 unt; 0 def)
% Number of atoms : 86 ( 2 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 94 ( 36 ~; 24 |; 29 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-4 aty)
% Number of variables : 52 ( 40 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f534,plain,
$false,
inference(resolution,[],[f532,f186]) ).
fof(f186,plain,
finite(sK0),
inference(cnf_transformation,[],[f133]) ).
fof(f133,plain,
( ~ finite(cartesian_product4(sK0,sK1,sK2,sK3))
& finite(sK3)
& finite(sK2)
& finite(sK1)
& finite(sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f88,f132]) ).
fof(f132,plain,
( ? [X0,X1,X2,X3] :
( ~ finite(cartesian_product4(X0,X1,X2,X3))
& finite(X3)
& finite(X2)
& finite(X1)
& finite(X0) )
=> ( ~ finite(cartesian_product4(sK0,sK1,sK2,sK3))
& finite(sK3)
& finite(sK2)
& finite(sK1)
& finite(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f88,plain,
? [X0,X1,X2,X3] :
( ~ finite(cartesian_product4(X0,X1,X2,X3))
& finite(X3)
& finite(X2)
& finite(X1)
& finite(X0) ),
inference(flattening,[],[f87]) ).
fof(f87,plain,
? [X0,X1,X2,X3] :
( ~ finite(cartesian_product4(X0,X1,X2,X3))
& finite(X3)
& finite(X2)
& finite(X1)
& finite(X0) ),
inference(ennf_transformation,[],[f57]) ).
fof(f57,negated_conjecture,
~ ! [X0,X1,X2,X3] :
( ( finite(X3)
& finite(X2)
& finite(X1)
& finite(X0) )
=> finite(cartesian_product4(X0,X1,X2,X3)) ),
inference(negated_conjecture,[],[f56]) ).
fof(f56,conjecture,
! [X0,X1,X2,X3] :
( ( finite(X3)
& finite(X2)
& finite(X1)
& finite(X0) )
=> finite(cartesian_product4(X0,X1,X2,X3)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t21_finset_1) ).
fof(f532,plain,
~ finite(sK0),
inference(resolution,[],[f530,f187]) ).
fof(f187,plain,
finite(sK1),
inference(cnf_transformation,[],[f133]) ).
fof(f530,plain,
( ~ finite(sK1)
| ~ finite(sK0) ),
inference(resolution,[],[f528,f188]) ).
fof(f188,plain,
finite(sK2),
inference(cnf_transformation,[],[f133]) ).
fof(f528,plain,
( ~ finite(sK2)
| ~ finite(sK1)
| ~ finite(sK0) ),
inference(resolution,[],[f524,f189]) ).
fof(f189,plain,
finite(sK3),
inference(cnf_transformation,[],[f133]) ).
fof(f524,plain,
( ~ finite(sK3)
| ~ finite(sK2)
| ~ finite(sK1)
| ~ finite(sK0) ),
inference(resolution,[],[f523,f254]) ).
fof(f254,plain,
! [X2,X0,X1] :
( finite(cartesian_product3(X0,X1,X2))
| ~ finite(X2)
| ~ finite(X1)
| ~ finite(X0) ),
inference(cnf_transformation,[],[f124]) ).
fof(f124,plain,
! [X0,X1,X2] :
( finite(cartesian_product3(X0,X1,X2))
| ~ finite(X2)
| ~ finite(X1)
| ~ finite(X0) ),
inference(flattening,[],[f123]) ).
fof(f123,plain,
! [X0,X1,X2] :
( finite(cartesian_product3(X0,X1,X2))
| ~ finite(X2)
| ~ finite(X1)
| ~ finite(X0) ),
inference(ennf_transformation,[],[f18]) ).
fof(f18,axiom,
! [X0,X1,X2] :
( ( finite(X2)
& finite(X1)
& finite(X0) )
=> finite(cartesian_product3(X0,X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fc15_finset_1) ).
fof(f523,plain,
( ~ finite(cartesian_product3(sK0,sK1,sK2))
| ~ finite(sK3) ),
inference(resolution,[],[f443,f190]) ).
fof(f190,plain,
~ finite(cartesian_product4(sK0,sK1,sK2,sK3)),
inference(cnf_transformation,[],[f133]) ).
fof(f443,plain,
! [X2,X3,X0,X1] :
( finite(cartesian_product4(X0,X1,X2,X3))
| ~ finite(X3)
| ~ finite(cartesian_product3(X0,X1,X2)) ),
inference(superposition,[],[f247,f258]) ).
fof(f258,plain,
! [X2,X3,X0,X1] : cartesian_product4(X0,X1,X2,X3) = cartesian_product2(cartesian_product3(X0,X1,X2),X3),
inference(cnf_transformation,[],[f14]) ).
fof(f14,axiom,
! [X0,X1,X2,X3] : cartesian_product4(X0,X1,X2,X3) = cartesian_product2(cartesian_product3(X0,X1,X2),X3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d4_zfmisc_1) ).
fof(f247,plain,
! [X0,X1] :
( finite(cartesian_product2(X0,X1))
| ~ finite(X1)
| ~ finite(X0) ),
inference(cnf_transformation,[],[f114]) ).
fof(f114,plain,
! [X0,X1] :
( finite(cartesian_product2(X0,X1))
| ~ finite(X1)
| ~ finite(X0) ),
inference(flattening,[],[f113]) ).
fof(f113,plain,
! [X0,X1] :
( finite(cartesian_product2(X0,X1))
| ~ finite(X1)
| ~ finite(X0) ),
inference(ennf_transformation,[],[f53]) ).
fof(f53,axiom,
! [X0,X1] :
( ( finite(X1)
& finite(X0) )
=> finite(cartesian_product2(X0,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t19_finset_1) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.12 % Problem : SEU090+1 : TPTP v8.1.2. Released v3.2.0.
% 0.05/0.13 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.10/0.33 % Computer : n020.cluster.edu
% 0.10/0.33 % Model : x86_64 x86_64
% 0.10/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.33 % Memory : 8042.1875MB
% 0.10/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.33 % CPULimit : 300
% 0.10/0.33 % WCLimit : 300
% 0.10/0.33 % DateTime : Mon Apr 29 20:26:32 EDT 2024
% 0.10/0.34 % CPUTime :
% 0.10/0.34 % (13010)Running in auto input_syntax mode. Trying TPTP
% 0.10/0.36 % (13013)WARNING: value z3 for option sas not known
% 0.10/0.37 % (13013)dis+2_11_add=large:afr=on:amm=off:bd=off:bce=on:fsd=off:fde=none:gs=on:gsaa=full_model:gsem=off:irw=on:msp=off:nm=4:nwc=1.3:sas=z3:sims=off:sac=on:sp=reverse_arity_569 on theBenchmark for (569ds/0Mi)
% 0.10/0.38 % (13016)ott-10_8_av=off:bd=preordered:bs=on:fsd=off:fsr=off:fde=unused:irw=on:lcm=predicate:lma=on:nm=4:nwc=1.7:sp=frequency_522 on theBenchmark for (522ds/0Mi)
% 0.10/0.38 % (13014)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.10/0.38 % (13011)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.10/0.39 TRYING [1]
% 0.10/0.39 TRYING [2]
% 0.10/0.39 % (13012)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.10/0.39 TRYING [3]
% 0.17/0.40 % (13016)First to succeed.
% 0.17/0.40 TRYING [4]
% 0.17/0.41 % (13016)Refutation found. Thanks to Tanya!
% 0.17/0.41 % SZS status Theorem for theBenchmark
% 0.17/0.41 % SZS output start Proof for theBenchmark
% See solution above
% 0.17/0.41 % (13016)------------------------------
% 0.17/0.41 % (13016)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.17/0.41 % (13016)Termination reason: Refutation
% 0.17/0.41
% 0.17/0.41 % (13016)Memory used [KB]: 1017
% 0.17/0.41 % (13016)Time elapsed: 0.045 s
% 0.17/0.41 % (13016)Instructions burned: 17 (million)
% 0.17/0.41 % (13016)------------------------------
% 0.17/0.41 % (13016)------------------------------
% 0.17/0.41 % (13010)Success in time 0.069 s
%------------------------------------------------------------------------------