TSTP Solution File: SET044+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SET044+1 : TPTP v8.2.0. Released v2.0.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 : n005.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:08:14 EDT 2024
% Result : Theorem 0.59s 0.75s
% Output : Refutation 0.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 3
% Syntax : Number of formulae : 17 ( 4 unt; 0 def)
% Number of atoms : 66 ( 0 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 83 ( 34 ~; 25 |; 14 &)
% ( 6 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-1 aty)
% Number of variables : 42 ( 30 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f22,plain,
$false,
inference(subsumption_resolution,[],[f20,f18]) ).
fof(f18,plain,
~ element(sK0(sK1),sK1),
inference(factoring,[],[f13]) ).
fof(f13,plain,
! [X0] :
( ~ element(sK0(X0),X0)
| ~ element(sK0(X0),sK1) ),
inference(resolution,[],[f11,f9]) ).
fof(f9,plain,
! [X4] :
( element(X4,X4)
| ~ element(X4,sK1) ),
inference(cnf_transformation,[],[f8]) ).
fof(f8,plain,
( ! [X0,X2] :
( ( element(X2,sK0(X0))
| element(X2,X0) )
& ( ~ element(X2,X0)
| ~ element(X2,sK0(X0)) ) )
& ! [X4] :
( ( element(X4,sK1)
| ~ element(X4,X4) )
& ( element(X4,X4)
| ~ element(X4,sK1) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f5,f7,f6]) ).
fof(f6,plain,
! [X0] :
( ? [X1] :
! [X2] :
( ( element(X2,X1)
| element(X2,X0) )
& ( ~ element(X2,X0)
| ~ element(X2,X1) ) )
=> ! [X2] :
( ( element(X2,sK0(X0))
| element(X2,X0) )
& ( ~ element(X2,X0)
| ~ element(X2,sK0(X0)) ) ) ),
introduced(choice_axiom,[]) ).
fof(f7,plain,
( ? [X3] :
! [X4] :
( ( element(X4,X3)
| ~ element(X4,X4) )
& ( element(X4,X4)
| ~ element(X4,X3) ) )
=> ! [X4] :
( ( element(X4,sK1)
| ~ element(X4,X4) )
& ( element(X4,X4)
| ~ element(X4,sK1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f5,plain,
( ! [X0] :
? [X1] :
! [X2] :
( ( element(X2,X1)
| element(X2,X0) )
& ( ~ element(X2,X0)
| ~ element(X2,X1) ) )
& ? [X3] :
! [X4] :
( ( element(X4,X3)
| ~ element(X4,X4) )
& ( element(X4,X4)
| ~ element(X4,X3) ) ) ),
inference(rectify,[],[f4]) ).
fof(f4,plain,
( ! [X2] :
? [X3] :
! [X4] :
( ( element(X4,X3)
| element(X4,X2) )
& ( ~ element(X4,X2)
| ~ element(X4,X3) ) )
& ? [X0] :
! [X1] :
( ( element(X1,X0)
| ~ element(X1,X1) )
& ( element(X1,X1)
| ~ element(X1,X0) ) ) ),
inference(nnf_transformation,[],[f3]) ).
fof(f3,plain,
( ! [X2] :
? [X3] :
! [X4] :
( element(X4,X3)
<=> ~ element(X4,X2) )
& ? [X0] :
! [X1] :
( element(X1,X0)
<=> element(X1,X1) ) ),
inference(ennf_transformation,[],[f2]) ).
fof(f2,negated_conjecture,
~ ( ? [X0] :
! [X1] :
( element(X1,X0)
<=> element(X1,X1) )
=> ~ ! [X2] :
? [X3] :
! [X4] :
( element(X4,X3)
<=> ~ element(X4,X2) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f1,conjecture,
( ? [X0] :
! [X1] :
( element(X1,X0)
<=> element(X1,X1) )
=> ~ ! [X2] :
? [X3] :
! [X4] :
( element(X4,X3)
<=> ~ element(X4,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel40) ).
fof(f11,plain,
! [X2,X0] :
( ~ element(X2,sK0(X0))
| ~ element(X2,X0) ),
inference(cnf_transformation,[],[f8]) ).
fof(f20,plain,
element(sK0(sK1),sK1),
inference(resolution,[],[f19,f12]) ).
fof(f12,plain,
! [X2,X0] :
( element(X2,sK0(X0))
| element(X2,X0) ),
inference(cnf_transformation,[],[f8]) ).
fof(f19,plain,
~ element(sK0(sK1),sK0(sK1)),
inference(resolution,[],[f18,f10]) ).
fof(f10,plain,
! [X4] :
( element(X4,sK1)
| ~ element(X4,X4) ),
inference(cnf_transformation,[],[f8]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SET044+1 : TPTP v8.2.0. Released v2.0.0.
% 0.11/0.14 % 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.35 % Computer : n005.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 : Mon May 20 13:17:08 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/benchmark/theBenchmark.p
% 0.59/0.74 % (21761)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 (2996ds/56Mi)
% 0.59/0.75 % (21761)First to succeed.
% 0.59/0.75 % (21753)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 (2996ds/34Mi)
% 0.59/0.75 % (21755)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.59/0.75 % (21761)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-21752"
% 0.59/0.75 % (21758)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 (2996ds/34Mi)
% 0.59/0.75 % (21754)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 (2996ds/51Mi)
% 0.59/0.75 % (21759)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2996ds/45Mi)
% 0.59/0.75 % (21757)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2996ds/33Mi)
% 0.59/0.75 % (21760)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 (2996ds/83Mi)
% 0.59/0.75 % (21761)Refutation found. Thanks to Tanya!
% 0.59/0.75 % SZS status Theorem for theBenchmark
% 0.59/0.75 % SZS output start Proof for theBenchmark
% See solution above
% 0.59/0.75 % (21761)------------------------------
% 0.59/0.75 % (21761)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.59/0.75 % (21761)Termination reason: Refutation
% 0.59/0.75
% 0.59/0.75 % (21761)Memory used [KB]: 972
% 0.59/0.75 % (21761)Time elapsed: 0.002 s
% 0.59/0.75 % (21761)Instructions burned: 3 (million)
% 0.59/0.75 % (21752)Success in time 0.383 s
% 0.59/0.75 % Vampire---4.8 exiting
%------------------------------------------------------------------------------