TSTP Solution File: SEU173+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU173+1 : TPTP v8.2.0. 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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n028.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 May 21 03:45:16 EDT 2024
% Result : Theorem 0.62s 0.80s
% Output : Refutation 0.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 8
% Syntax : Number of formulae : 35 ( 7 unt; 0 def)
% Number of atoms : 136 ( 8 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 161 ( 60 ~; 55 |; 28 &)
% ( 8 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 72 ( 62 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f127,plain,
$false,
inference(subsumption_resolution,[],[f126,f110]) ).
fof(f110,plain,
~ subset(sK3,sK4),
inference(resolution,[],[f89,f78]) ).
fof(f78,plain,
! [X3,X0] :
( in(X3,powerset(X0))
| ~ subset(X3,X0) ),
inference(equality_resolution,[],[f53]) ).
fof(f53,plain,
! [X3,X0,X1] :
( in(X3,X1)
| ~ subset(X3,X0)
| powerset(X0) != X1 ),
inference(cnf_transformation,[],[f33]) ).
fof(f33,plain,
! [X0,X1] :
( ( powerset(X0) = X1
| ( ( ~ subset(sK0(X0,X1),X0)
| ~ in(sK0(X0,X1),X1) )
& ( subset(sK0(X0,X1),X0)
| in(sK0(X0,X1),X1) ) ) )
& ( ! [X3] :
( ( in(X3,X1)
| ~ subset(X3,X0) )
& ( subset(X3,X0)
| ~ in(X3,X1) ) )
| powerset(X0) != X1 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f31,f32]) ).
fof(f32,plain,
! [X0,X1] :
( ? [X2] :
( ( ~ subset(X2,X0)
| ~ in(X2,X1) )
& ( subset(X2,X0)
| in(X2,X1) ) )
=> ( ( ~ subset(sK0(X0,X1),X0)
| ~ in(sK0(X0,X1),X1) )
& ( subset(sK0(X0,X1),X0)
| in(sK0(X0,X1),X1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f31,plain,
! [X0,X1] :
( ( powerset(X0) = X1
| ? [X2] :
( ( ~ subset(X2,X0)
| ~ in(X2,X1) )
& ( subset(X2,X0)
| in(X2,X1) ) ) )
& ( ! [X3] :
( ( in(X3,X1)
| ~ subset(X3,X0) )
& ( subset(X3,X0)
| ~ in(X3,X1) ) )
| powerset(X0) != X1 ) ),
inference(rectify,[],[f30]) ).
fof(f30,plain,
! [X0,X1] :
( ( powerset(X0) = X1
| ? [X2] :
( ( ~ subset(X2,X0)
| ~ in(X2,X1) )
& ( subset(X2,X0)
| in(X2,X1) ) ) )
& ( ! [X2] :
( ( in(X2,X1)
| ~ subset(X2,X0) )
& ( subset(X2,X0)
| ~ in(X2,X1) ) )
| powerset(X0) != X1 ) ),
inference(nnf_transformation,[],[f2]) ).
fof(f2,axiom,
! [X0,X1] :
( powerset(X0) = X1
<=> ! [X2] :
( in(X2,X1)
<=> subset(X2,X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_zfmisc_1) ).
fof(f89,plain,
~ in(sK3,powerset(sK4)),
inference(subsumption_resolution,[],[f87,f64]) ).
fof(f64,plain,
! [X0] : ~ empty(powerset(X0)),
inference(cnf_transformation,[],[f9]) ).
fof(f9,axiom,
! [X0] : ~ empty(powerset(X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fc1_subset_1) ).
fof(f87,plain,
( ~ in(sK3,powerset(sK4))
| empty(powerset(sK4)) ),
inference(resolution,[],[f67,f57]) ).
fof(f57,plain,
! [X0,X1] :
( element(X1,X0)
| ~ in(X1,X0)
| empty(X0) ),
inference(cnf_transformation,[],[f34]) ).
fof(f34,plain,
! [X0,X1] :
( ( ( ( element(X1,X0)
| ~ empty(X1) )
& ( empty(X1)
| ~ element(X1,X0) ) )
| ~ empty(X0) )
& ( ( ( element(X1,X0)
| ~ in(X1,X0) )
& ( in(X1,X0)
| ~ element(X1,X0) ) )
| empty(X0) ) ),
inference(nnf_transformation,[],[f23]) ).
fof(f23,plain,
! [X0,X1] :
( ( ( element(X1,X0)
<=> empty(X1) )
| ~ empty(X0) )
& ( ( element(X1,X0)
<=> in(X1,X0) )
| empty(X0) ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f3,axiom,
! [X0,X1] :
( ( empty(X0)
=> ( element(X1,X0)
<=> empty(X1) ) )
& ( ~ empty(X0)
=> ( element(X1,X0)
<=> in(X1,X0) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_subset_1) ).
fof(f67,plain,
~ element(sK3,powerset(sK4)),
inference(cnf_transformation,[],[f42]) ).
fof(f42,plain,
( ~ element(sK3,powerset(sK4))
& ! [X2] :
( in(X2,sK4)
| ~ in(X2,sK3) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4])],[f25,f41]) ).
fof(f41,plain,
( ? [X0,X1] :
( ~ element(X0,powerset(X1))
& ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) ) )
=> ( ~ element(sK3,powerset(sK4))
& ! [X2] :
( in(X2,sK4)
| ~ in(X2,sK3) ) ) ),
introduced(choice_axiom,[]) ).
fof(f25,plain,
? [X0,X1] :
( ~ element(X0,powerset(X1))
& ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) ) ),
inference(ennf_transformation,[],[f12]) ).
fof(f12,negated_conjecture,
~ ! [X0,X1] :
( ! [X2] :
( in(X2,X0)
=> in(X2,X1) )
=> element(X0,powerset(X1)) ),
inference(negated_conjecture,[],[f11]) ).
fof(f11,conjecture,
! [X0,X1] :
( ! [X2] :
( in(X2,X0)
=> in(X2,X1) )
=> element(X0,powerset(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l71_subset_1) ).
fof(f126,plain,
subset(sK3,sK4),
inference(duplicate_literal_removal,[],[f123]) ).
fof(f123,plain,
( subset(sK3,sK4)
| subset(sK3,sK4) ),
inference(resolution,[],[f96,f61]) ).
fof(f61,plain,
! [X0,X1] :
( subset(X0,X1)
| in(sK1(X0,X1),X0) ),
inference(cnf_transformation,[],[f38]) ).
fof(f38,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ( ~ in(sK1(X0,X1),X1)
& in(sK1(X0,X1),X0) ) )
& ( ! [X3] :
( in(X3,X1)
| ~ in(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f36,f37]) ).
fof(f37,plain,
! [X0,X1] :
( ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) )
=> ( ~ in(sK1(X0,X1),X1)
& in(sK1(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f36,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) ) )
& ( ! [X3] :
( in(X3,X1)
| ~ in(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(rectify,[],[f35]) ).
fof(f35,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) ) )
& ( ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) )
| ~ subset(X0,X1) ) ),
inference(nnf_transformation,[],[f24]) ).
fof(f24,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) ) ),
inference(ennf_transformation,[],[f4]) ).
fof(f4,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X0)
=> in(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_tarski) ).
fof(f96,plain,
! [X0] :
( ~ in(sK1(X0,sK4),sK3)
| subset(X0,sK4) ),
inference(resolution,[],[f66,f62]) ).
fof(f62,plain,
! [X0,X1] :
( subset(X0,X1)
| ~ in(sK1(X0,X1),X1) ),
inference(cnf_transformation,[],[f38]) ).
fof(f66,plain,
! [X2] :
( in(X2,sK4)
| ~ in(X2,sK3) ),
inference(cnf_transformation,[],[f42]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SEU173+1 : TPTP v8.2.0. Released v3.3.0.
% 0.15/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.15/0.35 % Computer : n028.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Sun May 19 16:48:08 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.15/0.35 This is a FOF_THM_RFO_SEQ problem
% 0.15/0.35 Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.62/0.79 % (8338)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on theBenchmark for (2995ds/56Mi)
% 0.62/0.79 % (8330)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 theBenchmark for (2995ds/34Mi)
% 0.62/0.79 % (8332)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2995ds/78Mi)
% 0.62/0.79 % (8338)Refutation not found, incomplete strategy% (8338)------------------------------
% 0.62/0.79 % (8338)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.62/0.79 % (8338)Termination reason: Refutation not found, incomplete strategy
% 0.62/0.79
% 0.62/0.79 % (8338)Memory used [KB]: 974
% 0.62/0.79 % (8338)Time elapsed: 0.002 s
% 0.62/0.79 % (8338)Instructions burned: 3 (million)
% 0.62/0.79 % (8333)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2995ds/33Mi)
% 0.62/0.79 % (8331)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 theBenchmark for (2995ds/51Mi)
% 0.62/0.79 % (8336)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2995ds/45Mi)
% 0.62/0.79 % (8335)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 theBenchmark for (2995ds/34Mi)
% 0.62/0.79 % (8337)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 theBenchmark for (2995ds/83Mi)
% 0.62/0.79 % (8338)------------------------------
% 0.62/0.79 % (8338)------------------------------
% 0.62/0.80 % (8336)Refutation not found, incomplete strategy% (8336)------------------------------
% 0.62/0.80 % (8336)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.62/0.80 % (8336)Termination reason: Refutation not found, incomplete strategy
% 0.62/0.80
% 0.62/0.80 % (8336)Memory used [KB]: 970
% 0.62/0.80 % (8336)Time elapsed: 0.003 s
% 0.62/0.80 % (8336)Instructions burned: 2 (million)
% 0.62/0.80 % (8336)------------------------------
% 0.62/0.80 % (8336)------------------------------
% 0.62/0.80 % (8335)First to succeed.
% 0.62/0.80 % (8330)Also succeeded, but the first one will report.
% 0.62/0.80 % (8340)lrs+21_1:16_sil=2000:sp=occurrence:urr=on:flr=on:i=55:sd=1:nm=0:ins=3:ss=included:rawr=on:br=off_0 on theBenchmark for (2995ds/55Mi)
% 0.62/0.80 % (8335)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-8308"
% 0.62/0.80 % (8335)Refutation found. Thanks to Tanya!
% 0.62/0.80 % SZS status Theorem for theBenchmark
% 0.62/0.80 % SZS output start Proof for theBenchmark
% See solution above
% 0.62/0.80 % (8335)------------------------------
% 0.62/0.80 % (8335)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.62/0.80 % (8335)Termination reason: Refutation
% 0.62/0.80
% 0.62/0.80 % (8335)Memory used [KB]: 1052
% 0.62/0.80 % (8335)Time elapsed: 0.004 s
% 0.62/0.80 % (8335)Instructions burned: 4 (million)
% 0.62/0.80 % (8308)Success in time 0.439 s
% 0.62/0.80 % Vampire---4.8 exiting
%------------------------------------------------------------------------------