TSTP Solution File: SET879+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SET879+1 : TPTP v8.2.0. 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 : n029.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:13:47 EDT 2024
% Result : Theorem 0.53s 0.71s
% Output : Refutation 0.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 7
% Syntax : Number of formulae : 39 ( 3 unt; 0 def)
% Number of atoms : 123 ( 70 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 142 ( 58 ~; 58 |; 16 &)
% ( 7 <=>; 2 =>; 0 <=; 1 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 3 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 47 ( 38 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f56,plain,
$false,
inference(avatar_sat_refutation,[],[f36,f37,f52,f55]) ).
fof(f55,plain,
( ~ spl3_1
| ~ spl3_2 ),
inference(avatar_contradiction_clause,[],[f54]) ).
fof(f54,plain,
( $false
| ~ spl3_1
| ~ spl3_2 ),
inference(subsumption_resolution,[],[f53,f43]) ).
fof(f43,plain,
! [X0] : singleton(X0) != set_difference(singleton(X0),singleton(X0)),
inference(unit_resulting_resolution,[],[f26,f23]) ).
fof(f23,plain,
! [X0,X1] :
( singleton(X0) != set_difference(singleton(X0),X1)
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f16]) ).
fof(f16,plain,
! [X0,X1] :
( ( singleton(X0) = set_difference(singleton(X0),X1)
| in(X0,X1) )
& ( ~ in(X0,X1)
| singleton(X0) != set_difference(singleton(X0),X1) ) ),
inference(nnf_transformation,[],[f3]) ).
fof(f3,axiom,
! [X0,X1] :
( singleton(X0) = set_difference(singleton(X0),X1)
<=> ~ in(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l34_zfmisc_1) ).
fof(f26,plain,
! [X3] : in(X3,singleton(X3)),
inference(equality_resolution,[],[f25]) ).
fof(f25,plain,
! [X3,X1] :
( in(X3,X1)
| singleton(X3) != X1 ),
inference(equality_resolution,[],[f20]) ).
fof(f20,plain,
! [X3,X0,X1] :
( in(X3,X1)
| X0 != X3
| singleton(X0) != X1 ),
inference(cnf_transformation,[],[f15]) ).
fof(f15,plain,
! [X0,X1] :
( ( singleton(X0) = X1
| ( ( sK2(X0,X1) != X0
| ~ in(sK2(X0,X1),X1) )
& ( sK2(X0,X1) = X0
| in(sK2(X0,X1),X1) ) ) )
& ( ! [X3] :
( ( in(X3,X1)
| X0 != X3 )
& ( X0 = X3
| ~ in(X3,X1) ) )
| singleton(X0) != X1 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2])],[f13,f14]) ).
fof(f14,plain,
! [X0,X1] :
( ? [X2] :
( ( X0 != X2
| ~ in(X2,X1) )
& ( X0 = X2
| in(X2,X1) ) )
=> ( ( sK2(X0,X1) != X0
| ~ in(sK2(X0,X1),X1) )
& ( sK2(X0,X1) = X0
| in(sK2(X0,X1),X1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f13,plain,
! [X0,X1] :
( ( singleton(X0) = X1
| ? [X2] :
( ( X0 != X2
| ~ in(X2,X1) )
& ( X0 = X2
| in(X2,X1) ) ) )
& ( ! [X3] :
( ( in(X3,X1)
| X0 != X3 )
& ( X0 = X3
| ~ in(X3,X1) ) )
| singleton(X0) != X1 ) ),
inference(rectify,[],[f12]) ).
fof(f12,plain,
! [X0,X1] :
( ( singleton(X0) = X1
| ? [X2] :
( ( X0 != X2
| ~ in(X2,X1) )
& ( X0 = X2
| in(X2,X1) ) ) )
& ( ! [X2] :
( ( in(X2,X1)
| X0 != X2 )
& ( X0 = X2
| ~ in(X2,X1) ) )
| singleton(X0) != X1 ) ),
inference(nnf_transformation,[],[f2]) ).
fof(f2,axiom,
! [X0,X1] :
( singleton(X0) = X1
<=> ! [X2] :
( in(X2,X1)
<=> X0 = X2 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_tarski) ).
fof(f53,plain,
( singleton(sK0) = set_difference(singleton(sK0),singleton(sK0))
| ~ spl3_1
| ~ spl3_2 ),
inference(forward_demodulation,[],[f30,f35]) ).
fof(f35,plain,
( sK0 = sK1
| ~ spl3_2 ),
inference(avatar_component_clause,[],[f33]) ).
fof(f33,plain,
( spl3_2
<=> sK0 = sK1 ),
introduced(avatar_definition,[new_symbols(naming,[spl3_2])]) ).
fof(f30,plain,
( singleton(sK0) = set_difference(singleton(sK0),singleton(sK1))
| ~ spl3_1 ),
inference(avatar_component_clause,[],[f29]) ).
fof(f29,plain,
( spl3_1
<=> singleton(sK0) = set_difference(singleton(sK0),singleton(sK1)) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_1])]) ).
fof(f52,plain,
( spl3_1
| spl3_2 ),
inference(avatar_contradiction_clause,[],[f51]) ).
fof(f51,plain,
( $false
| spl3_1
| spl3_2 ),
inference(subsumption_resolution,[],[f45,f31]) ).
fof(f31,plain,
( singleton(sK0) != set_difference(singleton(sK0),singleton(sK1))
| spl3_1 ),
inference(avatar_component_clause,[],[f29]) ).
fof(f45,plain,
( singleton(sK0) = set_difference(singleton(sK0),singleton(sK1))
| spl3_2 ),
inference(unit_resulting_resolution,[],[f39,f24]) ).
fof(f24,plain,
! [X0,X1] :
( singleton(X0) = set_difference(singleton(X0),X1)
| in(X0,X1) ),
inference(cnf_transformation,[],[f16]) ).
fof(f39,plain,
( ~ in(sK0,singleton(sK1))
| spl3_2 ),
inference(unit_resulting_resolution,[],[f34,f27]) ).
fof(f27,plain,
! [X3,X0] :
( X0 = X3
| ~ in(X3,singleton(X0)) ),
inference(equality_resolution,[],[f19]) ).
fof(f19,plain,
! [X3,X0,X1] :
( X0 = X3
| ~ in(X3,X1)
| singleton(X0) != X1 ),
inference(cnf_transformation,[],[f15]) ).
fof(f34,plain,
( sK0 != sK1
| spl3_2 ),
inference(avatar_component_clause,[],[f33]) ).
fof(f37,plain,
( spl3_1
| ~ spl3_2 ),
inference(avatar_split_clause,[],[f17,f33,f29]) ).
fof(f17,plain,
( sK0 != sK1
| singleton(sK0) = set_difference(singleton(sK0),singleton(sK1)) ),
inference(cnf_transformation,[],[f11]) ).
fof(f11,plain,
( ( sK0 = sK1
| singleton(sK0) != set_difference(singleton(sK0),singleton(sK1)) )
& ( sK0 != sK1
| singleton(sK0) = set_difference(singleton(sK0),singleton(sK1)) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f9,f10]) ).
fof(f10,plain,
( ? [X0,X1] :
( ( X0 = X1
| singleton(X0) != set_difference(singleton(X0),singleton(X1)) )
& ( X0 != X1
| singleton(X0) = set_difference(singleton(X0),singleton(X1)) ) )
=> ( ( sK0 = sK1
| singleton(sK0) != set_difference(singleton(sK0),singleton(sK1)) )
& ( sK0 != sK1
| singleton(sK0) = set_difference(singleton(sK0),singleton(sK1)) ) ) ),
introduced(choice_axiom,[]) ).
fof(f9,plain,
? [X0,X1] :
( ( X0 = X1
| singleton(X0) != set_difference(singleton(X0),singleton(X1)) )
& ( X0 != X1
| singleton(X0) = set_difference(singleton(X0),singleton(X1)) ) ),
inference(nnf_transformation,[],[f8]) ).
fof(f8,plain,
? [X0,X1] :
( singleton(X0) = set_difference(singleton(X0),singleton(X1))
<~> X0 != X1 ),
inference(ennf_transformation,[],[f7]) ).
fof(f7,negated_conjecture,
~ ! [X0,X1] :
( singleton(X0) = set_difference(singleton(X0),singleton(X1))
<=> X0 != X1 ),
inference(negated_conjecture,[],[f6]) ).
fof(f6,conjecture,
! [X0,X1] :
( singleton(X0) = set_difference(singleton(X0),singleton(X1))
<=> X0 != X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t20_zfmisc_1) ).
fof(f36,plain,
( ~ spl3_1
| spl3_2 ),
inference(avatar_split_clause,[],[f18,f33,f29]) ).
fof(f18,plain,
( sK0 = sK1
| singleton(sK0) != set_difference(singleton(sK0),singleton(sK1)) ),
inference(cnf_transformation,[],[f11]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SET879+1 : TPTP v8.2.0. Released v3.2.0.
% 0.06/0.12 % 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.12/0.33 % Computer : n029.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Mon May 20 12:47:38 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.12/0.33 This is a FOF_THM_RFO_SEQ problem
% 0.12/0.34 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.53/0.71 % (29801)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.53/0.71 % (29800)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.53/0.71 % (29799)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.53/0.71 % (29801)First to succeed.
% 0.53/0.71 % (29805)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.53/0.71 % (29801)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-29797"
% 0.53/0.71 % (29800)Also succeeded, but the first one will report.
% 0.53/0.71 % (29802)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.53/0.71 % (29801)Refutation found. Thanks to Tanya!
% 0.53/0.71 % SZS status Theorem for theBenchmark
% 0.53/0.71 % SZS output start Proof for theBenchmark
% See solution above
% 0.53/0.71 % (29801)------------------------------
% 0.53/0.71 % (29801)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.53/0.71 % (29801)Termination reason: Refutation
% 0.53/0.71
% 0.53/0.71 % (29801)Memory used [KB]: 977
% 0.53/0.71 % (29801)Time elapsed: 0.003 s
% 0.53/0.71 % (29801)Instructions burned: 4 (million)
% 0.53/0.71 % (29797)Success in time 0.373 s
% 0.53/0.71 % Vampire---4.8 exiting
%------------------------------------------------------------------------------