TSTP Solution File: SEU089+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU089+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n008.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 1 03:50:01 EDT 2024
% Result : Theorem 0.61s 0.76s
% Output : Refutation 0.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 4
% Syntax : Number of formulae : 22 ( 10 unt; 0 def)
% Number of atoms : 54 ( 2 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 52 ( 20 ~; 8 |; 20 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-3 aty)
% Number of variables : 29 ( 20 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f135,plain,
$false,
inference(subsumption_resolution,[],[f134,f95]) ).
fof(f95,plain,
finite(sK0),
inference(cnf_transformation,[],[f80]) ).
fof(f80,plain,
( ~ finite(cartesian_product3(sK0,sK1,sK2))
& finite(sK2)
& finite(sK1)
& finite(sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f64,f79]) ).
fof(f79,plain,
( ? [X0,X1,X2] :
( ~ finite(cartesian_product3(X0,X1,X2))
& finite(X2)
& finite(X1)
& finite(X0) )
=> ( ~ finite(cartesian_product3(sK0,sK1,sK2))
& finite(sK2)
& finite(sK1)
& finite(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f64,plain,
? [X0,X1,X2] :
( ~ finite(cartesian_product3(X0,X1,X2))
& finite(X2)
& finite(X1)
& finite(X0) ),
inference(flattening,[],[f63]) ).
fof(f63,plain,
? [X0,X1,X2] :
( ~ finite(cartesian_product3(X0,X1,X2))
& finite(X2)
& finite(X1)
& finite(X0) ),
inference(ennf_transformation,[],[f54]) ).
fof(f54,negated_conjecture,
~ ! [X0,X1,X2] :
( ( finite(X2)
& finite(X1)
& finite(X0) )
=> finite(cartesian_product3(X0,X1,X2)) ),
inference(negated_conjecture,[],[f53]) ).
fof(f53,conjecture,
! [X0,X1,X2] :
( ( finite(X2)
& finite(X1)
& finite(X0) )
=> finite(cartesian_product3(X0,X1,X2)) ),
file('/export/starexec/sandbox/tmp/tmp.TeQPCa51n9/Vampire---4.8_2613',t20_finset_1) ).
fof(f134,plain,
~ finite(sK0),
inference(subsumption_resolution,[],[f131,f96]) ).
fof(f96,plain,
finite(sK1),
inference(cnf_transformation,[],[f80]) ).
fof(f131,plain,
( ~ finite(sK1)
| ~ finite(sK0) ),
inference(resolution,[],[f130,f114]) ).
fof(f114,plain,
! [X0,X1] :
( finite(cartesian_product2(X0,X1))
| ~ finite(X1)
| ~ finite(X0) ),
inference(cnf_transformation,[],[f77]) ).
fof(f77,plain,
! [X0,X1] :
( finite(cartesian_product2(X0,X1))
| ~ finite(X1)
| ~ finite(X0) ),
inference(flattening,[],[f76]) ).
fof(f76,plain,
! [X0,X1] :
( finite(cartesian_product2(X0,X1))
| ~ finite(X1)
| ~ finite(X0) ),
inference(ennf_transformation,[],[f17]) ).
fof(f17,axiom,
! [X0,X1] :
( ( finite(X1)
& finite(X0) )
=> finite(cartesian_product2(X0,X1)) ),
file('/export/starexec/sandbox/tmp/tmp.TeQPCa51n9/Vampire---4.8_2613',fc14_finset_1) ).
fof(f130,plain,
~ finite(cartesian_product2(sK0,sK1)),
inference(subsumption_resolution,[],[f127,f97]) ).
fof(f97,plain,
finite(sK2),
inference(cnf_transformation,[],[f80]) ).
fof(f127,plain,
( ~ finite(sK2)
| ~ finite(cartesian_product2(sK0,sK1)) ),
inference(resolution,[],[f121,f114]) ).
fof(f121,plain,
~ finite(cartesian_product2(cartesian_product2(sK0,sK1),sK2)),
inference(definition_unfolding,[],[f98,f100]) ).
fof(f100,plain,
! [X2,X0,X1] : cartesian_product3(X0,X1,X2) = cartesian_product2(cartesian_product2(X0,X1),X2),
inference(cnf_transformation,[],[f14]) ).
fof(f14,axiom,
! [X0,X1,X2] : cartesian_product3(X0,X1,X2) = cartesian_product2(cartesian_product2(X0,X1),X2),
file('/export/starexec/sandbox/tmp/tmp.TeQPCa51n9/Vampire---4.8_2613',d3_zfmisc_1) ).
fof(f98,plain,
~ finite(cartesian_product3(sK0,sK1,sK2)),
inference(cnf_transformation,[],[f80]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SEU089+1 : TPTP v8.1.2. Released v3.2.0.
% 0.07/0.15 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.15/0.36 % Computer : n008.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Tue Apr 30 16:11:42 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 This is a FOF_THM_RFO_SEQ problem
% 0.15/0.36 Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox/tmp/tmp.TeQPCa51n9/Vampire---4.8_2613
% 0.61/0.76 % (2867)lrs+21_1:5_sil=2000:sos=on:urr=on:newcnf=on:slsq=on:i=83:slsql=off:bd=off:nm=2:ss=axioms:st=1.5:sp=const_min:gsp=on:rawr=on_0 on Vampire---4 for (2996ds/83Mi)
% 0.61/0.76 % (2868)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on Vampire---4 for (2996ds/56Mi)
% 0.61/0.76 % (2861)dis-1011_2:1_sil=2000:lsd=20:nwc=5.0:flr=on:mep=off:st=3.0:i=34:sd=1:ep=RS:ss=axioms_0 on Vampire---4 for (2996ds/34Mi)
% 0.61/0.76 % (2863)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2996ds/78Mi)
% 0.61/0.76 % (2864)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2996ds/33Mi)
% 0.61/0.76 % (2862)lrs+1011_461:32768_sil=16000:irw=on:sp=frequency:lsd=20:fd=preordered:nwc=10.0:s2agt=32:alpa=false:cond=fast:s2a=on:i=51:s2at=3.0:awrs=decay:awrsf=691:bd=off:nm=20:fsr=off:amm=sco:uhcvi=on:rawr=on_0 on Vampire---4 for (2996ds/51Mi)
% 0.61/0.76 % (2865)lrs+2_1:1_sil=16000:fde=none:sos=all:nwc=5.0:i=34:ep=RS:s2pl=on:lma=on:afp=100000_0 on Vampire---4 for (2996ds/34Mi)
% 0.61/0.76 % (2866)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2996ds/45Mi)
% 0.61/0.76 % (2868)First to succeed.
% 0.61/0.76 % (2861)Also succeeded, but the first one will report.
% 0.61/0.76 % (2866)Also succeeded, but the first one will report.
% 0.61/0.76 % (2868)Refutation found. Thanks to Tanya!
% 0.61/0.76 % SZS status Theorem for Vampire---4
% 0.61/0.76 % SZS output start Proof for Vampire---4
% See solution above
% 0.61/0.76 % (2868)------------------------------
% 0.61/0.76 % (2868)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.61/0.76 % (2868)Termination reason: Refutation
% 0.61/0.76
% 0.61/0.76 % (2868)Memory used [KB]: 1055
% 0.61/0.76 % (2868)Time elapsed: 0.004 s
% 0.61/0.76 % (2868)Instructions burned: 3 (million)
% 0.61/0.76 % (2868)------------------------------
% 0.61/0.76 % (2868)------------------------------
% 0.61/0.76 % (2857)Success in time 0.389 s
% 0.61/0.76 % Vampire---4.8 exiting
%------------------------------------------------------------------------------