TSTP Solution File: SET979+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SET979+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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n006.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:14:10 EDT 2024
% Result : Theorem 0.56s 0.74s
% Output : Refutation 0.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of formulae : 30 ( 9 unt; 1 typ; 0 def)
% Number of atoms : 389 ( 23 equ)
% Maximal formula atoms : 4 ( 13 avg)
% Number of connectives : 44 ( 22 ~; 15 |; 3 &)
% ( 3 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 338 ( 338 fml; 0 var)
% Number of types : 2 ( 0 usr)
% Number of type conns : 2 ( 1 >; 1 *; 0 +; 0 <<)
% Number of predicates : 12 ( 10 usr; 6 prp; 0-3 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 38 ( 31 !; 6 ?; 21 :)
% ( 1 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
tff(pred_def_2,type,
sQ3_eqProxy:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(f55,plain,
$false,
inference(avatar_sat_refutation,[],[f46,f50,f53]) ).
tff(f53,plain,
spl4_2,
inference(avatar_contradiction_clause,[],[f52]) ).
tff(f52,plain,
( $false
| spl4_2 ),
inference(subsumption_resolution,[],[f51,f31]) ).
tff(f31,plain,
! [X2: $i,X0: $i,X1: $i] : sQ3_eqProxy($i,cartesian_product2(X2,set_union2(X0,X1)),set_union2(cartesian_product2(X2,X0),cartesian_product2(X2,X1))),
inference(equality_proxy_replacement,[],[f21,f29]) ).
tff(f29,plain,
! [X0: $tType,X2: X0,X1: X0] :
( sQ3_eqProxy(X0,X1,X2)
<=> ( X1 = X2 ) ),
introduced(equality_proxy_definition,[new_symbols(naming,[sQ3_eqProxy])]) ).
tff(f21,plain,
! [X2: $i,X0: $i,X1: $i] : ( cartesian_product2(X2,set_union2(X0,X1)) = set_union2(cartesian_product2(X2,X0),cartesian_product2(X2,X1)) ),
inference(cnf_transformation,[],[f8]) ).
tff(f8,axiom,
! [X0,X1,X2] :
( ( cartesian_product2(X2,set_union2(X0,X1)) = set_union2(cartesian_product2(X2,X0),cartesian_product2(X2,X1)) )
& ( cartesian_product2(set_union2(X0,X1),X2) = set_union2(cartesian_product2(X0,X2),cartesian_product2(X1,X2)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t120_zfmisc_1) ).
tff(f51,plain,
( ~ sQ3_eqProxy($i,cartesian_product2(sK2,set_union2(singleton(sK0),singleton(sK1))),set_union2(cartesian_product2(sK2,singleton(sK0)),cartesian_product2(sK2,singleton(sK1))))
| spl4_2 ),
inference(forward_literal_rewriting,[],[f45,f37]) ).
tff(f37,plain,
! [X0: $tType,X2: X0,X1: X0] :
( sQ3_eqProxy(X0,X2,X1)
| ~ sQ3_eqProxy(X0,X1,X2) ),
inference(equality_proxy_axiom,[],[f29]) ).
tff(f45,plain,
( ~ sQ3_eqProxy($i,set_union2(cartesian_product2(sK2,singleton(sK0)),cartesian_product2(sK2,singleton(sK1))),cartesian_product2(sK2,set_union2(singleton(sK0),singleton(sK1))))
| spl4_2 ),
inference(avatar_component_clause,[],[f43]) ).
tff(f43,plain,
( spl4_2
<=> sQ3_eqProxy($i,set_union2(cartesian_product2(sK2,singleton(sK0)),cartesian_product2(sK2,singleton(sK1))),cartesian_product2(sK2,set_union2(singleton(sK0),singleton(sK1)))) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_2])]) ).
tff(f50,plain,
spl4_1,
inference(avatar_contradiction_clause,[],[f49]) ).
tff(f49,plain,
( $false
| spl4_1 ),
inference(resolution,[],[f32,f47]) ).
tff(f47,plain,
( ~ sQ3_eqProxy($i,cartesian_product2(set_union2(singleton(sK0),singleton(sK1)),sK2),set_union2(cartesian_product2(singleton(sK0),sK2),cartesian_product2(singleton(sK1),sK2)))
| spl4_1 ),
inference(resolution,[],[f37,f41]) ).
tff(f41,plain,
( ~ sQ3_eqProxy($i,set_union2(cartesian_product2(singleton(sK0),sK2),cartesian_product2(singleton(sK1),sK2)),cartesian_product2(set_union2(singleton(sK0),singleton(sK1)),sK2))
| spl4_1 ),
inference(avatar_component_clause,[],[f39]) ).
tff(f39,plain,
( spl4_1
<=> sQ3_eqProxy($i,set_union2(cartesian_product2(singleton(sK0),sK2),cartesian_product2(singleton(sK1),sK2)),cartesian_product2(set_union2(singleton(sK0),singleton(sK1)),sK2)) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_1])]) ).
tff(f32,plain,
! [X2: $i,X0: $i,X1: $i] : sQ3_eqProxy($i,cartesian_product2(set_union2(X0,X1),X2),set_union2(cartesian_product2(X0,X2),cartesian_product2(X1,X2))),
inference(equality_proxy_replacement,[],[f20,f29]) ).
tff(f20,plain,
! [X2: $i,X0: $i,X1: $i] : ( cartesian_product2(set_union2(X0,X1),X2) = set_union2(cartesian_product2(X0,X2),cartesian_product2(X1,X2)) ),
inference(cnf_transformation,[],[f8]) ).
tff(f46,plain,
( ~ spl4_1
| ~ spl4_2 ),
inference(avatar_split_clause,[],[f30,f43,f39]) ).
tff(f30,plain,
( ~ sQ3_eqProxy($i,set_union2(cartesian_product2(sK2,singleton(sK0)),cartesian_product2(sK2,singleton(sK1))),cartesian_product2(sK2,set_union2(singleton(sK0),singleton(sK1))))
| ~ sQ3_eqProxy($i,set_union2(cartesian_product2(singleton(sK0),sK2),cartesian_product2(singleton(sK1),sK2)),cartesian_product2(set_union2(singleton(sK0),singleton(sK1)),sK2)) ),
inference(equality_proxy_replacement,[],[f27,f29]) ).
tff(f27,plain,
( ( set_union2(cartesian_product2(sK2,singleton(sK0)),cartesian_product2(sK2,singleton(sK1))) != cartesian_product2(sK2,set_union2(singleton(sK0),singleton(sK1))) )
| ( set_union2(cartesian_product2(singleton(sK0),sK2),cartesian_product2(singleton(sK1),sK2)) != cartesian_product2(set_union2(singleton(sK0),singleton(sK1)),sK2) ) ),
inference(definition_unfolding,[],[f18,f19,f19]) ).
tff(f19,plain,
! [X0: $i,X1: $i] : ( unordered_pair(X0,X1) = set_union2(singleton(X0),singleton(X1)) ),
inference(cnf_transformation,[],[f11]) ).
tff(f11,axiom,
! [X0,X1] : ( unordered_pair(X0,X1) = set_union2(singleton(X0),singleton(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t41_enumset1) ).
tff(f18,plain,
( ( cartesian_product2(sK2,unordered_pair(sK0,sK1)) != set_union2(cartesian_product2(sK2,singleton(sK0)),cartesian_product2(sK2,singleton(sK1))) )
| ( cartesian_product2(unordered_pair(sK0,sK1),sK2) != set_union2(cartesian_product2(singleton(sK0),sK2),cartesian_product2(singleton(sK1),sK2)) ) ),
inference(cnf_transformation,[],[f17]) ).
tff(f17,plain,
( ( cartesian_product2(sK2,unordered_pair(sK0,sK1)) != set_union2(cartesian_product2(sK2,singleton(sK0)),cartesian_product2(sK2,singleton(sK1))) )
| ( cartesian_product2(unordered_pair(sK0,sK1),sK2) != set_union2(cartesian_product2(singleton(sK0),sK2),cartesian_product2(singleton(sK1),sK2)) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f13,f16]) ).
tff(f16,plain,
( ? [X0,X1,X2] :
( ( cartesian_product2(X2,unordered_pair(X0,X1)) != set_union2(cartesian_product2(X2,singleton(X0)),cartesian_product2(X2,singleton(X1))) )
| ( cartesian_product2(unordered_pair(X0,X1),X2) != set_union2(cartesian_product2(singleton(X0),X2),cartesian_product2(singleton(X1),X2)) ) )
=> ( ( cartesian_product2(sK2,unordered_pair(sK0,sK1)) != set_union2(cartesian_product2(sK2,singleton(sK0)),cartesian_product2(sK2,singleton(sK1))) )
| ( cartesian_product2(unordered_pair(sK0,sK1),sK2) != set_union2(cartesian_product2(singleton(sK0),sK2),cartesian_product2(singleton(sK1),sK2)) ) ) ),
introduced(choice_axiom,[]) ).
tff(f13,plain,
? [X0,X1,X2] :
( ( cartesian_product2(X2,unordered_pair(X0,X1)) != set_union2(cartesian_product2(X2,singleton(X0)),cartesian_product2(X2,singleton(X1))) )
| ( cartesian_product2(unordered_pair(X0,X1),X2) != set_union2(cartesian_product2(singleton(X0),X2),cartesian_product2(singleton(X1),X2)) ) ),
inference(ennf_transformation,[],[f10]) ).
tff(f10,negated_conjecture,
~ ! [X0,X1,X2] :
( ( cartesian_product2(X2,unordered_pair(X0,X1)) = set_union2(cartesian_product2(X2,singleton(X0)),cartesian_product2(X2,singleton(X1))) )
& ( cartesian_product2(unordered_pair(X0,X1),X2) = set_union2(cartesian_product2(singleton(X0),X2),cartesian_product2(singleton(X1),X2)) ) ),
inference(negated_conjecture,[],[f9]) ).
tff(f9,conjecture,
! [X0,X1,X2] :
( ( cartesian_product2(X2,unordered_pair(X0,X1)) = set_union2(cartesian_product2(X2,singleton(X0)),cartesian_product2(X2,singleton(X1))) )
& ( cartesian_product2(unordered_pair(X0,X1),X2) = set_union2(cartesian_product2(singleton(X0),X2),cartesian_product2(singleton(X1),X2)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t132_zfmisc_1) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SET979+1 : TPTP v8.2.0. Released v3.2.0.
% 0.11/0.12 % 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.11/0.33 % Computer : n006.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Mon May 20 11:24:08 EDT 2024
% 0.11/0.33 % CPUTime :
% 0.11/0.33 This is a FOF_THM_RFO_SEQ problem
% 0.11/0.33 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.56/0.74 % (2466)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.56/0.74 % (2463)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.56/0.74 % (2464)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.56/0.74 % (2468)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.56/0.74 % (2470)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.56/0.74 % (2463)First to succeed.
% 0.56/0.74 % (2470)Refutation not found, incomplete strategy% (2470)------------------------------
% 0.56/0.74 % (2470)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.56/0.74 % (2470)Termination reason: Refutation not found, incomplete strategy
% 0.56/0.74
% 0.56/0.74 % (2470)Memory used [KB]: 955
% 0.56/0.74 % (2470)Time elapsed: 0.002 s
% 0.56/0.74 % (2470)Instructions burned: 2 (million)
% 0.56/0.74 % (2469)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.56/0.74 % (2464)Also succeeded, but the first one will report.
% 0.56/0.74 % (2470)------------------------------
% 0.56/0.74 % (2470)------------------------------
% 0.56/0.74 % (2463)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-2462"
% 0.56/0.74 % (2469)Also succeeded, but the first one will report.
% 0.56/0.74 % (2463)Refutation found. Thanks to Tanya!
% 0.56/0.74 % SZS status Theorem for theBenchmark
% 0.56/0.74 % SZS output start Proof for theBenchmark
% See solution above
% 0.56/0.74 % (2463)------------------------------
% 0.56/0.74 % (2463)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.56/0.74 % (2463)Termination reason: Refutation
% 0.56/0.74
% 0.56/0.74 % (2463)Memory used [KB]: 987
% 0.56/0.74 % (2463)Time elapsed: 0.004 s
% 0.56/0.74 % (2463)Instructions burned: 4 (million)
% 0.56/0.74 % (2462)Success in time 0.406 s
% 0.56/0.74 % Vampire---4.8 exiting
%------------------------------------------------------------------------------