TSTP Solution File: SEU167+3 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU167+3 : 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 : n003.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:24 EDT 2024
% Result : Theorem 0.62s 0.76s
% Output : Refutation 0.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 4
% Syntax : Number of formulae : 22 ( 5 unt; 0 def)
% Number of atoms : 54 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 55 ( 23 ~; 12 |; 15 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 46 ( 34 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f38,plain,
$false,
inference(subsumption_resolution,[],[f37,f16]) ).
fof(f16,plain,
subset(sK0,sK1),
inference(cnf_transformation,[],[f15]) ).
fof(f15,plain,
( ~ subset(cartesian_product2(sK0,sK2),cartesian_product2(sK1,sK3))
& subset(sK2,sK3)
& subset(sK0,sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f10,f14]) ).
fof(f14,plain,
( ? [X0,X1,X2,X3] :
( ~ subset(cartesian_product2(X0,X2),cartesian_product2(X1,X3))
& subset(X2,X3)
& subset(X0,X1) )
=> ( ~ subset(cartesian_product2(sK0,sK2),cartesian_product2(sK1,sK3))
& subset(sK2,sK3)
& subset(sK0,sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f10,plain,
? [X0,X1,X2,X3] :
( ~ subset(cartesian_product2(X0,X2),cartesian_product2(X1,X3))
& subset(X2,X3)
& subset(X0,X1) ),
inference(flattening,[],[f9]) ).
fof(f9,plain,
? [X0,X1,X2,X3] :
( ~ subset(cartesian_product2(X0,X2),cartesian_product2(X1,X3))
& subset(X2,X3)
& subset(X0,X1) ),
inference(ennf_transformation,[],[f6]) ).
fof(f6,negated_conjecture,
~ ! [X0,X1,X2,X3] :
( ( subset(X2,X3)
& subset(X0,X1) )
=> subset(cartesian_product2(X0,X2),cartesian_product2(X1,X3)) ),
inference(negated_conjecture,[],[f5]) ).
fof(f5,conjecture,
! [X0,X1,X2,X3] :
( ( subset(X2,X3)
& subset(X0,X1) )
=> subset(cartesian_product2(X0,X2),cartesian_product2(X1,X3)) ),
file('/export/starexec/sandbox/tmp/tmp.QkGe5eB3xs/Vampire---4.8_10746',t119_zfmisc_1) ).
fof(f37,plain,
~ subset(sK0,sK1),
inference(subsumption_resolution,[],[f32,f17]) ).
fof(f17,plain,
subset(sK2,sK3),
inference(cnf_transformation,[],[f15]) ).
fof(f32,plain,
( ~ subset(sK2,sK3)
| ~ subset(sK0,sK1) ),
inference(resolution,[],[f24,f19]) ).
fof(f19,plain,
! [X2,X0,X1] :
( subset(cartesian_product2(X0,X2),cartesian_product2(X1,X2))
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f11]) ).
fof(f11,plain,
! [X0,X1,X2] :
( ( subset(cartesian_product2(X2,X0),cartesian_product2(X2,X1))
& subset(cartesian_product2(X0,X2),cartesian_product2(X1,X2)) )
| ~ subset(X0,X1) ),
inference(ennf_transformation,[],[f4]) ).
fof(f4,axiom,
! [X0,X1,X2] :
( subset(X0,X1)
=> ( subset(cartesian_product2(X2,X0),cartesian_product2(X2,X1))
& subset(cartesian_product2(X0,X2),cartesian_product2(X1,X2)) ) ),
file('/export/starexec/sandbox/tmp/tmp.QkGe5eB3xs/Vampire---4.8_10746',t118_zfmisc_1) ).
fof(f24,plain,
! [X0] :
( ~ subset(cartesian_product2(sK0,sK2),cartesian_product2(sK1,X0))
| ~ subset(X0,sK3) ),
inference(resolution,[],[f23,f20]) ).
fof(f20,plain,
! [X2,X0,X1] :
( subset(cartesian_product2(X2,X0),cartesian_product2(X2,X1))
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f11]) ).
fof(f23,plain,
! [X0] :
( ~ subset(X0,cartesian_product2(sK1,sK3))
| ~ subset(cartesian_product2(sK0,sK2),X0) ),
inference(resolution,[],[f18,f21]) ).
fof(f21,plain,
! [X2,X0,X1] :
( subset(X0,X2)
| ~ subset(X1,X2)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f13]) ).
fof(f13,plain,
! [X0,X1,X2] :
( subset(X0,X2)
| ~ subset(X1,X2)
| ~ subset(X0,X1) ),
inference(flattening,[],[f12]) ).
fof(f12,plain,
! [X0,X1,X2] :
( subset(X0,X2)
| ~ subset(X1,X2)
| ~ subset(X0,X1) ),
inference(ennf_transformation,[],[f7]) ).
fof(f7,axiom,
! [X0,X1,X2] :
( ( subset(X1,X2)
& subset(X0,X1) )
=> subset(X0,X2) ),
file('/export/starexec/sandbox/tmp/tmp.QkGe5eB3xs/Vampire---4.8_10746',t1_xboole_1) ).
fof(f18,plain,
~ subset(cartesian_product2(sK0,sK2),cartesian_product2(sK1,sK3)),
inference(cnf_transformation,[],[f15]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SEU167+3 : TPTP v8.1.2. Released v3.2.0.
% 0.03/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 : n003.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:16:18 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 This is a FOF_THM_RFO_NEQ 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.QkGe5eB3xs/Vampire---4.8_10746
% 0.62/0.76 % (11125)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.62/0.76 % (11125)First to succeed.
% 0.62/0.76 % (11118)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.62/0.76 % (11120)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.62/0.76 % (11122)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.62/0.76 % (11123)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.62/0.76 % (11119)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.62/0.76 % (11121)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.62/0.76 % (11124)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.62/0.76 % (11125)Refutation found. Thanks to Tanya!
% 0.62/0.76 % SZS status Theorem for Vampire---4
% 0.62/0.76 % SZS output start Proof for Vampire---4
% See solution above
% 0.62/0.76 % (11125)------------------------------
% 0.62/0.76 % (11125)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.62/0.76 % (11125)Termination reason: Refutation
% 0.62/0.76
% 0.62/0.76 % (11125)Memory used [KB]: 974
% 0.62/0.76 % (11125)Time elapsed: 0.002 s
% 0.62/0.76 % (11125)Instructions burned: 3 (million)
% 0.62/0.76 % (11125)------------------------------
% 0.62/0.76 % (11125)------------------------------
% 0.62/0.76 % (11001)Success in time 0.394 s
% 0.62/0.77 % Vampire---4.8 exiting
%------------------------------------------------------------------------------