TSTP Solution File: SEU165+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU165+1 : TPTP v8.1.2. Released v3.3.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 : n011.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 : Sun May 5 09:20:39 EDT 2024
% Result : Theorem 0.67s 0.84s
% Output : Refutation 0.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 3
% Syntax : Number of formulae : 23 ( 5 unt; 0 def)
% Number of atoms : 77 ( 0 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 89 ( 35 ~; 31 |; 18 &)
% ( 3 <=>; 1 =>; 0 <=; 1 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 48 ( 32 !; 16 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f37,plain,
$false,
inference(subsumption_resolution,[],[f36,f32]) ).
fof(f32,plain,
in(sK0,sK2),
inference(subsumption_resolution,[],[f22,f30]) ).
fof(f30,plain,
~ in(ordered_pair(sK0,sK1),cartesian_product2(sK2,sK3)),
inference(subsumption_resolution,[],[f29,f26]) ).
fof(f26,plain,
! [X2,X3,X0,X1] :
( ~ in(ordered_pair(X0,X1),cartesian_product2(X2,X3))
| in(X0,X2) ),
inference(cnf_transformation,[],[f21]) ).
fof(f21,plain,
! [X0,X1,X2,X3] :
( ( in(ordered_pair(X0,X1),cartesian_product2(X2,X3))
| ~ in(X1,X3)
| ~ in(X0,X2) )
& ( ( in(X1,X3)
& in(X0,X2) )
| ~ in(ordered_pair(X0,X1),cartesian_product2(X2,X3)) ) ),
inference(flattening,[],[f20]) ).
fof(f20,plain,
! [X0,X1,X2,X3] :
( ( in(ordered_pair(X0,X1),cartesian_product2(X2,X3))
| ~ in(X1,X3)
| ~ in(X0,X2) )
& ( ( in(X1,X3)
& in(X0,X2) )
| ~ in(ordered_pair(X0,X1),cartesian_product2(X2,X3)) ) ),
inference(nnf_transformation,[],[f13]) ).
fof(f13,axiom,
! [X0,X1,X2,X3] :
( in(ordered_pair(X0,X1),cartesian_product2(X2,X3))
<=> ( in(X1,X3)
& in(X0,X2) ) ),
file('/export/starexec/sandbox/tmp/tmp.uYZJpR3Gqp/Vampire---4.8_9039',l55_zfmisc_1) ).
fof(f29,plain,
( ~ in(sK0,sK2)
| ~ in(ordered_pair(sK0,sK1),cartesian_product2(sK2,sK3)) ),
inference(subsumption_resolution,[],[f24,f27]) ).
fof(f27,plain,
! [X2,X3,X0,X1] :
( ~ in(ordered_pair(X0,X1),cartesian_product2(X2,X3))
| in(X1,X3) ),
inference(cnf_transformation,[],[f21]) ).
fof(f24,plain,
( ~ in(sK1,sK3)
| ~ in(sK0,sK2)
| ~ in(ordered_pair(sK0,sK1),cartesian_product2(sK2,sK3)) ),
inference(cnf_transformation,[],[f19]) ).
fof(f19,plain,
( ( ~ in(sK1,sK3)
| ~ in(sK0,sK2)
| ~ in(ordered_pair(sK0,sK1),cartesian_product2(sK2,sK3)) )
& ( ( in(sK1,sK3)
& in(sK0,sK2) )
| in(ordered_pair(sK0,sK1),cartesian_product2(sK2,sK3)) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f17,f18]) ).
fof(f18,plain,
( ? [X0,X1,X2,X3] :
( ( ~ in(X1,X3)
| ~ in(X0,X2)
| ~ in(ordered_pair(X0,X1),cartesian_product2(X2,X3)) )
& ( ( in(X1,X3)
& in(X0,X2) )
| in(ordered_pair(X0,X1),cartesian_product2(X2,X3)) ) )
=> ( ( ~ in(sK1,sK3)
| ~ in(sK0,sK2)
| ~ in(ordered_pair(sK0,sK1),cartesian_product2(sK2,sK3)) )
& ( ( in(sK1,sK3)
& in(sK0,sK2) )
| in(ordered_pair(sK0,sK1),cartesian_product2(sK2,sK3)) ) ) ),
introduced(choice_axiom,[]) ).
fof(f17,plain,
? [X0,X1,X2,X3] :
( ( ~ in(X1,X3)
| ~ in(X0,X2)
| ~ in(ordered_pair(X0,X1),cartesian_product2(X2,X3)) )
& ( ( in(X1,X3)
& in(X0,X2) )
| in(ordered_pair(X0,X1),cartesian_product2(X2,X3)) ) ),
inference(flattening,[],[f16]) ).
fof(f16,plain,
? [X0,X1,X2,X3] :
( ( ~ in(X1,X3)
| ~ in(X0,X2)
| ~ in(ordered_pair(X0,X1),cartesian_product2(X2,X3)) )
& ( ( in(X1,X3)
& in(X0,X2) )
| in(ordered_pair(X0,X1),cartesian_product2(X2,X3)) ) ),
inference(nnf_transformation,[],[f14]) ).
fof(f14,plain,
? [X0,X1,X2,X3] :
( in(ordered_pair(X0,X1),cartesian_product2(X2,X3))
<~> ( in(X1,X3)
& in(X0,X2) ) ),
inference(ennf_transformation,[],[f12]) ).
fof(f12,negated_conjecture,
~ ! [X0,X1,X2,X3] :
( in(ordered_pair(X0,X1),cartesian_product2(X2,X3))
<=> ( in(X1,X3)
& in(X0,X2) ) ),
inference(negated_conjecture,[],[f11]) ).
fof(f11,conjecture,
! [X0,X1,X2,X3] :
( in(ordered_pair(X0,X1),cartesian_product2(X2,X3))
<=> ( in(X1,X3)
& in(X0,X2) ) ),
file('/export/starexec/sandbox/tmp/tmp.uYZJpR3Gqp/Vampire---4.8_9039',t106_zfmisc_1) ).
fof(f22,plain,
( in(sK0,sK2)
| in(ordered_pair(sK0,sK1),cartesian_product2(sK2,sK3)) ),
inference(cnf_transformation,[],[f19]) ).
fof(f36,plain,
~ in(sK0,sK2),
inference(subsumption_resolution,[],[f35,f31]) ).
fof(f31,plain,
in(sK1,sK3),
inference(subsumption_resolution,[],[f23,f30]) ).
fof(f23,plain,
( in(sK1,sK3)
| in(ordered_pair(sK0,sK1),cartesian_product2(sK2,sK3)) ),
inference(cnf_transformation,[],[f19]) ).
fof(f35,plain,
( ~ in(sK1,sK3)
| ~ in(sK0,sK2) ),
inference(resolution,[],[f30,f28]) ).
fof(f28,plain,
! [X2,X3,X0,X1] :
( in(ordered_pair(X0,X1),cartesian_product2(X2,X3))
| ~ in(X1,X3)
| ~ in(X0,X2) ),
inference(cnf_transformation,[],[f21]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SEU165+1 : TPTP v8.1.2. Released v3.3.0.
% 0.08/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.14/0.35 % Computer : n011.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Fri May 3 11:45:19 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.14/0.36 This is a FOF_THM_RFO_SEQ problem
% 0.14/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.uYZJpR3Gqp/Vampire---4.8_9039
% 0.64/0.84 % (9378)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 (2995ds/34Mi)
% 0.64/0.84 % (9380)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2995ds/78Mi)
% 0.64/0.84 % (9379)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 (2995ds/51Mi)
% 0.64/0.84 % (9381)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2995ds/33Mi)
% 0.64/0.84 % (9382)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 (2995ds/34Mi)
% 0.64/0.84 % (9383)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2995ds/45Mi)
% 0.64/0.84 % (9384)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 (2995ds/83Mi)
% 0.64/0.84 % (9382)Also succeeded, but the first one will report.
% 0.64/0.84 % (9383)First to succeed.
% 0.64/0.84 % (9378)Also succeeded, but the first one will report.
% 0.64/0.84 % (9385)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 (2995ds/56Mi)
% 0.64/0.84 % (9384)Also succeeded, but the first one will report.
% 0.67/0.84 % (9383)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-9286"
% 0.67/0.84 % (9381)Also succeeded, but the first one will report.
% 0.67/0.84 % (9385)Also succeeded, but the first one will report.
% 0.67/0.84 % (9383)Refutation found. Thanks to Tanya!
% 0.67/0.84 % SZS status Theorem for Vampire---4
% 0.67/0.84 % SZS output start Proof for Vampire---4
% See solution above
% 0.67/0.84 % (9383)------------------------------
% 0.67/0.84 % (9383)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.67/0.84 % (9383)Termination reason: Refutation
% 0.67/0.84
% 0.67/0.84 % (9383)Memory used [KB]: 974
% 0.67/0.84 % (9383)Time elapsed: 0.003 s
% 0.67/0.84 % (9383)Instructions burned: 3 (million)
% 0.67/0.84 % (9286)Success in time 0.478 s
% 0.67/0.85 % Vampire---4.8 exiting
%------------------------------------------------------------------------------