TSTP Solution File: SET874+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SET874+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 : n011.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:46 EDT 2024
% Result : Theorem 0.58s 0.74s
% Output : Refutation 0.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of formulae : 26 ( 9 unt; 1 typ; 0 def)
% Number of atoms : 192 ( 65 equ)
% Maximal formula atoms : 14 ( 7 avg)
% Number of connectives : 127 ( 50 ~; 47 |; 24 &)
% ( 3 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 6 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 90 ( 90 fml; 0 var)
% Number of types : 2 ( 0 usr)
% Number of type conns : 2 ( 1 >; 1 *; 0 +; 0 <<)
% Number of predicates : 10 ( 8 usr; 3 prp; 0-3 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 61 ( 52 !; 8 ?; 22 :)
% ( 1 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
tff(pred_def_3,type,
sQ3_eqProxy:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(f59,plain,
$false,
inference(subsumption_resolution,[],[f58,f41]) ).
tff(f41,plain,
! [X1: $i,X4: $i] : in(X4,unordered_pair(X4,X1)),
inference(equality_resolution,[],[f40]) ).
tff(f40,plain,
! [X2: $i,X1: $i,X4: $i] :
( in(X4,X2)
| ( unordered_pair(X4,X1) != X2 ) ),
inference(equality_resolution,[],[f29]) ).
tff(f29,plain,
! [X2: $i,X0: $i,X1: $i,X4: $i] :
( in(X4,X2)
| ( X0 != X4 )
| ( unordered_pair(X0,X1) != X2 ) ),
inference(cnf_transformation,[],[f24]) ).
tff(f24,plain,
! [X0,X1,X2] :
( ( ( unordered_pair(X0,X1) = X2 )
| ( ( ( ( sK2(X0,X1,X2) != X1 )
& ( sK2(X0,X1,X2) != X0 ) )
| ~ in(sK2(X0,X1,X2),X2) )
& ( ( sK2(X0,X1,X2) = X1 )
| ( sK2(X0,X1,X2) = X0 )
| in(sK2(X0,X1,X2),X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ( ( X1 != X4 )
& ( X0 != X4 ) ) )
& ( ( X1 = X4 )
| ( X0 = X4 )
| ~ in(X4,X2) ) )
| ( unordered_pair(X0,X1) != X2 ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2])],[f22,f23]) ).
tff(f23,plain,
! [X0,X1,X2] :
( ? [X3] :
( ( ( ( X1 != X3 )
& ( X0 != X3 ) )
| ~ in(X3,X2) )
& ( ( X1 = X3 )
| ( X0 = X3 )
| in(X3,X2) ) )
=> ( ( ( ( sK2(X0,X1,X2) != X1 )
& ( sK2(X0,X1,X2) != X0 ) )
| ~ in(sK2(X0,X1,X2),X2) )
& ( ( sK2(X0,X1,X2) = X1 )
| ( sK2(X0,X1,X2) = X0 )
| in(sK2(X0,X1,X2),X2) ) ) ),
introduced(choice_axiom,[]) ).
tff(f22,plain,
! [X0,X1,X2] :
( ( ( unordered_pair(X0,X1) = X2 )
| ? [X3] :
( ( ( ( X1 != X3 )
& ( X0 != X3 ) )
| ~ in(X3,X2) )
& ( ( X1 = X3 )
| ( X0 = X3 )
| in(X3,X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ( ( X1 != X4 )
& ( X0 != X4 ) ) )
& ( ( X1 = X4 )
| ( X0 = X4 )
| ~ in(X4,X2) ) )
| ( unordered_pair(X0,X1) != X2 ) ) ),
inference(rectify,[],[f21]) ).
tff(f21,plain,
! [X0,X1,X2] :
( ( ( unordered_pair(X0,X1) = X2 )
| ? [X3] :
( ( ( ( X1 != X3 )
& ( X0 != X3 ) )
| ~ in(X3,X2) )
& ( ( X1 = X3 )
| ( X0 = X3 )
| in(X3,X2) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| ( ( X1 != X3 )
& ( X0 != X3 ) ) )
& ( ( X1 = X3 )
| ( X0 = X3 )
| ~ in(X3,X2) ) )
| ( unordered_pair(X0,X1) != X2 ) ) ),
inference(flattening,[],[f20]) ).
tff(f20,plain,
! [X0,X1,X2] :
( ( ( unordered_pair(X0,X1) = X2 )
| ? [X3] :
( ( ( ( X1 != X3 )
& ( X0 != X3 ) )
| ~ in(X3,X2) )
& ( ( X1 = X3 )
| ( X0 = X3 )
| in(X3,X2) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| ( ( X1 != X3 )
& ( X0 != X3 ) ) )
& ( ( X1 = X3 )
| ( X0 = X3 )
| ~ in(X3,X2) ) )
| ( unordered_pair(X0,X1) != X2 ) ) ),
inference(nnf_transformation,[],[f4]) ).
tff(f4,axiom,
! [X0,X1,X2] :
( ( unordered_pair(X0,X1) = X2 )
<=> ! [X3] :
( in(X3,X2)
<=> ( ( X1 = X3 )
| ( X0 = X3 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d2_tarski) ).
tff(f58,plain,
~ in(sK0,unordered_pair(sK0,sK1)),
inference(resolution,[],[f57,f44]) ).
tff(f44,plain,
~ sQ3_eqProxy($i,unordered_pair(sK0,sK1),set_union2(singleton(sK0),unordered_pair(sK0,sK1))),
inference(equality_proxy_replacement,[],[f25,f43]) ).
tff(f43,plain,
! [X0: $tType,X2: X0,X1: X0] :
( sQ3_eqProxy(X0,X1,X2)
<=> ( X1 = X2 ) ),
introduced(equality_proxy_definition,[new_symbols(naming,[sQ3_eqProxy])]) ).
tff(f25,plain,
unordered_pair(sK0,sK1) != set_union2(singleton(sK0),unordered_pair(sK0,sK1)),
inference(cnf_transformation,[],[f19]) ).
tff(f19,plain,
unordered_pair(sK0,sK1) != set_union2(singleton(sK0),unordered_pair(sK0,sK1)),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f14,f18]) ).
tff(f18,plain,
( ? [X0,X1] : ( unordered_pair(X0,X1) != set_union2(singleton(X0),unordered_pair(X0,X1)) )
=> ( unordered_pair(sK0,sK1) != set_union2(singleton(sK0),unordered_pair(sK0,sK1)) ) ),
introduced(choice_axiom,[]) ).
tff(f14,plain,
? [X0,X1] : ( unordered_pair(X0,X1) != set_union2(singleton(X0),unordered_pair(X0,X1)) ),
inference(ennf_transformation,[],[f12]) ).
tff(f12,negated_conjecture,
~ ! [X0,X1] : ( unordered_pair(X0,X1) = set_union2(singleton(X0),unordered_pair(X0,X1)) ),
inference(negated_conjecture,[],[f11]) ).
tff(f11,conjecture,
! [X0,X1] : ( unordered_pair(X0,X1) = set_union2(singleton(X0),unordered_pair(X0,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t14_zfmisc_1) ).
tff(f57,plain,
! [X0: $i,X1: $i] :
( sQ3_eqProxy($i,X1,set_union2(singleton(X0),X1))
| ~ in(X0,X1) ),
inference(forward_literal_rewriting,[],[f45,f54]) ).
tff(f54,plain,
! [X0: $tType,X2: X0,X1: X0] :
( sQ3_eqProxy(X0,X2,X1)
| ~ sQ3_eqProxy(X0,X1,X2) ),
inference(equality_proxy_axiom,[],[f43]) ).
tff(f45,plain,
! [X0: $i,X1: $i] :
( sQ3_eqProxy($i,set_union2(singleton(X0),X1),X1)
| ~ in(X0,X1) ),
inference(equality_proxy_replacement,[],[f26,f43]) ).
tff(f26,plain,
! [X0: $i,X1: $i] :
( ( set_union2(singleton(X0),X1) = X1 )
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f15]) ).
tff(f15,plain,
! [X0,X1] :
( ( set_union2(singleton(X0),X1) = X1 )
| ~ in(X0,X1) ),
inference(ennf_transformation,[],[f8]) ).
tff(f8,axiom,
! [X0,X1] :
( in(X0,X1)
=> ( set_union2(singleton(X0),X1) = X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l23_zfmisc_1) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SET874+1 : TPTP v8.2.0. Released v3.2.0.
% 0.04/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 : n011.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:22:53 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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.58/0.74 % (2763)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.58/0.74 % (2763)Refutation not found, incomplete strategy% (2763)------------------------------
% 0.58/0.74 % (2763)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.58/0.74 % (2763)Termination reason: Refutation not found, incomplete strategy
% 0.58/0.74
% 0.58/0.74 % (2763)Memory used [KB]: 972
% 0.58/0.74 % (2763)Time elapsed: 0.002 s
% 0.58/0.74 % (2763)Instructions burned: 2 (million)
% 0.58/0.74 % (2756)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.58/0.74 % (2758)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.58/0.74 % (2763)------------------------------
% 0.58/0.74 % (2763)------------------------------
% 0.58/0.74 % (2757)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.58/0.74 % (2760)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.58/0.74 % (2761)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.58/0.74 % (2759)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.58/0.74 % (2762)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.58/0.74 % (2756)First to succeed.
% 0.58/0.74 % (2760)Refutation not found, incomplete strategy% (2760)------------------------------
% 0.58/0.74 % (2760)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.58/0.74 % (2760)Termination reason: Refutation not found, incomplete strategy
% 0.58/0.74
% 0.58/0.74 % (2760)Memory used [KB]: 974
% 0.58/0.74 % (2760)Time elapsed: 0.003 s
% 0.58/0.74 % (2760)Instructions burned: 3 (million)
% 0.58/0.74 % (2761)Also succeeded, but the first one will report.
% 0.58/0.74 % (2759)Also succeeded, but the first one will report.
% 0.58/0.74 % (2760)------------------------------
% 0.58/0.74 % (2760)------------------------------
% 0.58/0.74 % (2762)Also succeeded, but the first one will report.
% 0.58/0.74 % (2757)Also succeeded, but the first one will report.
% 0.58/0.74 % (2756)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-2755"
% 0.58/0.74 % (2764)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 (2996ds/55Mi)
% 0.58/0.74 % (2758)Also succeeded, but the first one will report.
% 0.58/0.74 % (2756)Refutation found. Thanks to Tanya!
% 0.58/0.74 % SZS status Theorem for theBenchmark
% 0.58/0.74 % SZS output start Proof for theBenchmark
% See solution above
% 0.58/0.74 % (2756)------------------------------
% 0.58/0.74 % (2756)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.58/0.74 % (2756)Termination reason: Refutation
% 0.58/0.74
% 0.58/0.74 % (2756)Memory used [KB]: 979
% 0.58/0.74 % (2756)Time elapsed: 0.004 s
% 0.58/0.74 % (2756)Instructions burned: 4 (million)
% 0.58/0.74 % (2755)Success in time 0.381 s
% 0.58/0.74 % Vampire---4.8 exiting
%------------------------------------------------------------------------------