TSTP Solution File: SWC095+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC095+1 : TPTP v8.1.2. Released v2.4.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 : n020.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 : Wed May 1 03:59:45 EDT 2024
% Result : Theorem 0.54s 0.76s
% Output : Refutation 0.54s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 10
% Syntax : Number of formulae : 34 ( 11 unt; 1 typ; 0 def)
% Number of atoms : 516 ( 99 equ)
% Maximal formula atoms : 32 ( 15 avg)
% Number of connectives : 342 ( 106 ~; 85 |; 128 &)
% ( 1 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 8 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 247 ( 247 fml; 0 var)
% Number of types : 2 ( 0 usr)
% Number of type conns : 2 ( 1 >; 1 *; 0 +; 0 <<)
% Number of predicates : 12 ( 10 usr; 8 prp; 0-3 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 138 ( 72 !; 65 ?; 22 :)
% ( 1 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
tff(pred_def_20,type,
sQ11_eqProxy:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(f218,plain,
$false,
inference(subsumption_resolution,[],[f217,f141]) ).
tff(f141,plain,
ssList(sK4),
inference(cnf_transformation,[],[f125]) ).
tff(f125,plain,
( ( sK3 = app(sK4,sK6) )
& ( sK2 = app(app(sK4,sK5),sK6) )
& ssList(sK6)
& ssList(sK5)
& ssList(sK4)
& ! [X7] :
( ! [X8] :
( ! [X9] :
( ( app(X7,X9) != sK1 )
| ( app(app(X7,X8),X9) != sK0 )
| ~ ssList(X9) )
| ~ ssList(X8) )
| ~ ssList(X7) )
& ( sK0 = sK2 )
& ( sK1 = sK3 )
& ssList(sK3)
& ssList(sK2)
& ssList(sK1)
& ssList(sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5,sK6])],[f99,f124,f123,f122,f121,f120,f119,f118]) ).
tff(f118,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ? [X5] :
( ? [X6] :
( ( app(X4,X6) = X3 )
& ( app(app(X4,X5),X6) = X2 )
& ssList(X6) )
& ssList(X5) )
& ssList(X4) )
& ! [X7] :
( ! [X8] :
( ! [X9] :
( ( app(X7,X9) != X1 )
| ( app(app(X7,X8),X9) != X0 )
| ~ ssList(X9) )
| ~ ssList(X8) )
| ~ ssList(X7) )
& ( X0 = X2 )
& ( X1 = X3 )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ? [X5] :
( ? [X6] :
( ( app(X4,X6) = X3 )
& ( app(app(X4,X5),X6) = X2 )
& ssList(X6) )
& ssList(X5) )
& ssList(X4) )
& ! [X7] :
( ! [X8] :
( ! [X9] :
( ( app(X7,X9) != X1 )
| ( app(app(X7,X8),X9) != sK0 )
| ~ ssList(X9) )
| ~ ssList(X8) )
| ~ ssList(X7) )
& ( sK0 = X2 )
& ( X1 = X3 )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK0) ) ),
introduced(choice_axiom,[]) ).
tff(f119,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ? [X5] :
( ? [X6] :
( ( app(X4,X6) = X3 )
& ( app(app(X4,X5),X6) = X2 )
& ssList(X6) )
& ssList(X5) )
& ssList(X4) )
& ! [X7] :
( ! [X8] :
( ! [X9] :
( ( app(X7,X9) != X1 )
| ( app(app(X7,X8),X9) != sK0 )
| ~ ssList(X9) )
| ~ ssList(X8) )
| ~ ssList(X7) )
& ( sK0 = X2 )
& ( X1 = X3 )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ? [X4] :
( ? [X5] :
( ? [X6] :
( ( app(X4,X6) = X3 )
& ( app(app(X4,X5),X6) = X2 )
& ssList(X6) )
& ssList(X5) )
& ssList(X4) )
& ! [X7] :
( ! [X8] :
( ! [X9] :
( ( app(X7,X9) != sK1 )
| ( app(app(X7,X8),X9) != sK0 )
| ~ ssList(X9) )
| ~ ssList(X8) )
| ~ ssList(X7) )
& ( sK0 = X2 )
& ( sK1 = X3 )
& ssList(X3) )
& ssList(X2) )
& ssList(sK1) ) ),
introduced(choice_axiom,[]) ).
tff(f120,plain,
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ? [X5] :
( ? [X6] :
( ( app(X4,X6) = X3 )
& ( app(app(X4,X5),X6) = X2 )
& ssList(X6) )
& ssList(X5) )
& ssList(X4) )
& ! [X7] :
( ! [X8] :
( ! [X9] :
( ( app(X7,X9) != sK1 )
| ( app(app(X7,X8),X9) != sK0 )
| ~ ssList(X9) )
| ~ ssList(X8) )
| ~ ssList(X7) )
& ( sK0 = X2 )
& ( sK1 = X3 )
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ? [X4] :
( ? [X5] :
( ? [X6] :
( ( app(X4,X6) = X3 )
& ( app(app(X4,X5),X6) = sK2 )
& ssList(X6) )
& ssList(X5) )
& ssList(X4) )
& ! [X7] :
( ! [X8] :
( ! [X9] :
( ( app(X7,X9) != sK1 )
| ( app(app(X7,X8),X9) != sK0 )
| ~ ssList(X9) )
| ~ ssList(X8) )
| ~ ssList(X7) )
& ( sK0 = sK2 )
& ( sK1 = X3 )
& ssList(X3) )
& ssList(sK2) ) ),
introduced(choice_axiom,[]) ).
tff(f121,plain,
( ? [X3] :
( ? [X4] :
( ? [X5] :
( ? [X6] :
( ( app(X4,X6) = X3 )
& ( app(app(X4,X5),X6) = sK2 )
& ssList(X6) )
& ssList(X5) )
& ssList(X4) )
& ! [X7] :
( ! [X8] :
( ! [X9] :
( ( app(X7,X9) != sK1 )
| ( app(app(X7,X8),X9) != sK0 )
| ~ ssList(X9) )
| ~ ssList(X8) )
| ~ ssList(X7) )
& ( sK0 = sK2 )
& ( sK1 = X3 )
& ssList(X3) )
=> ( ? [X4] :
( ? [X5] :
( ? [X6] :
( ( app(X4,X6) = sK3 )
& ( app(app(X4,X5),X6) = sK2 )
& ssList(X6) )
& ssList(X5) )
& ssList(X4) )
& ! [X7] :
( ! [X8] :
( ! [X9] :
( ( app(X7,X9) != sK1 )
| ( app(app(X7,X8),X9) != sK0 )
| ~ ssList(X9) )
| ~ ssList(X8) )
| ~ ssList(X7) )
& ( sK0 = sK2 )
& ( sK1 = sK3 )
& ssList(sK3) ) ),
introduced(choice_axiom,[]) ).
tff(f122,plain,
( ? [X4] :
( ? [X5] :
( ? [X6] :
( ( app(X4,X6) = sK3 )
& ( app(app(X4,X5),X6) = sK2 )
& ssList(X6) )
& ssList(X5) )
& ssList(X4) )
=> ( ? [X5] :
( ? [X6] :
( ( sK3 = app(sK4,X6) )
& ( sK2 = app(app(sK4,X5),X6) )
& ssList(X6) )
& ssList(X5) )
& ssList(sK4) ) ),
introduced(choice_axiom,[]) ).
tff(f123,plain,
( ? [X5] :
( ? [X6] :
( ( sK3 = app(sK4,X6) )
& ( sK2 = app(app(sK4,X5),X6) )
& ssList(X6) )
& ssList(X5) )
=> ( ? [X6] :
( ( sK3 = app(sK4,X6) )
& ( sK2 = app(app(sK4,sK5),X6) )
& ssList(X6) )
& ssList(sK5) ) ),
introduced(choice_axiom,[]) ).
tff(f124,plain,
( ? [X6] :
( ( sK3 = app(sK4,X6) )
& ( sK2 = app(app(sK4,sK5),X6) )
& ssList(X6) )
=> ( ( sK3 = app(sK4,sK6) )
& ( sK2 = app(app(sK4,sK5),sK6) )
& ssList(sK6) ) ),
introduced(choice_axiom,[]) ).
tff(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ? [X5] :
( ? [X6] :
( ( app(X4,X6) = X3 )
& ( app(app(X4,X5),X6) = X2 )
& ssList(X6) )
& ssList(X5) )
& ssList(X4) )
& ! [X7] :
( ! [X8] :
( ! [X9] :
( ( app(X7,X9) != X1 )
| ( app(app(X7,X8),X9) != X0 )
| ~ ssList(X9) )
| ~ ssList(X8) )
| ~ ssList(X7) )
& ( X0 = X2 )
& ( X1 = X3 )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f98]) ).
tff(f98,plain,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ! [X6] :
( ( app(X4,X6) != X3 )
| ( app(app(X4,X5),X6) != X2 )
| ~ ssList(X6) ) ) )
| ? [X7] :
( ? [X8] :
( ? [X9] :
( ( app(X7,X9) = X1 )
& ( app(app(X7,X8),X9) = X0 )
& ssList(X9) )
& ssList(X8) )
& ssList(X7) )
| ( X0 != X2 )
| ( X1 != X3 )
| ~ ssList(X3) ) ) ) ),
inference(rectify,[],[f97]) ).
tff(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ! [X7] :
( ssList(X7)
=> ! [X8] :
( ssList(X8)
=> ! [X9] :
( ( app(X7,X9) != X3 )
| ( app(app(X7,X8),X9) != X2 )
| ~ ssList(X9) ) ) )
| ? [X4] :
( ? [X5] :
( ? [X6] :
( ( app(X4,X6) = X1 )
& ( app(app(X4,X5),X6) = X0 )
& ssList(X6) )
& ssList(X5) )
& ssList(X4) )
| ( X0 != X2 )
| ( X1 != X3 )
| ~ ssList(X3) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
tff(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ! [X7] :
( ssList(X7)
=> ! [X8] :
( ssList(X8)
=> ! [X9] :
( ( app(X7,X9) != X3 )
| ( app(app(X7,X8),X9) != X2 )
| ~ ssList(X9) ) ) )
| ? [X4] :
( ? [X5] :
( ? [X6] :
( ( app(X4,X6) = X1 )
& ( app(app(X4,X5),X6) = X0 )
& ssList(X6) )
& ssList(X5) )
& ssList(X4) )
| ( X0 != X2 )
| ( X1 != X3 )
| ~ ssList(X3) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.8oX5ymXkf3/Vampire---4.8_4608',co1) ).
tff(f217,plain,
~ ssList(sK4),
inference(subsumption_resolution,[],[f216,f142]) ).
tff(f142,plain,
ssList(sK5),
inference(cnf_transformation,[],[f125]) ).
tff(f216,plain,
( ~ ssList(sK5)
| ~ ssList(sK4) ),
inference(subsumption_resolution,[],[f215,f143]) ).
tff(f143,plain,
ssList(sK6),
inference(cnf_transformation,[],[f125]) ).
tff(f215,plain,
( ~ ssList(sK6)
| ~ ssList(sK5)
| ~ ssList(sK4) ),
inference(subsumption_resolution,[],[f213,f175]) ).
tff(f175,plain,
sQ11_eqProxy($i,sK3,app(sK4,sK6)),
inference(equality_proxy_replacement,[],[f145,f174]) ).
tff(f174,plain,
! [X0: $tType,X2: X0,X1: X0] :
( sQ11_eqProxy(X0,X1,X2)
<=> ( X1 = X2 ) ),
introduced(equality_proxy_definition,[new_symbols(naming,[sQ11_eqProxy])]) ).
tff(f145,plain,
sK3 = app(sK4,sK6),
inference(cnf_transformation,[],[f125]) ).
tff(f213,plain,
( ~ sQ11_eqProxy($i,sK3,app(sK4,sK6))
| ~ ssList(sK6)
| ~ ssList(sK5)
| ~ ssList(sK4) ),
inference(resolution,[],[f211,f176]) ).
tff(f176,plain,
sQ11_eqProxy($i,sK2,app(app(sK4,sK5),sK6)),
inference(equality_proxy_replacement,[],[f144,f174]) ).
tff(f144,plain,
sK2 = app(app(sK4,sK5),sK6),
inference(cnf_transformation,[],[f125]) ).
tff(f211,plain,
! [X2: $i,X0: $i,X1: $i] :
( ~ sQ11_eqProxy($i,sK2,app(app(X0,X1),X2))
| ~ sQ11_eqProxy($i,sK3,app(X0,X2))
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(forward_literal_rewriting,[],[f209,f197]) ).
tff(f197,plain,
! [X0: $tType,X2: X0,X1: X0] :
( sQ11_eqProxy(X0,X2,X1)
| ~ sQ11_eqProxy(X0,X1,X2) ),
inference(equality_proxy_axiom,[],[f174]) ).
tff(f209,plain,
! [X2: $i,X0: $i,X1: $i] :
( ~ sQ11_eqProxy($i,sK2,app(app(X0,X1),X2))
| ~ sQ11_eqProxy($i,app(X0,X2),sK3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(resolution,[],[f197,f177]) ).
tff(f177,plain,
! [X8: $i,X9: $i,X7: $i] :
( ~ sQ11_eqProxy($i,app(app(X7,X8),X9),sK2)
| ~ sQ11_eqProxy($i,app(X7,X9),sK3)
| ~ ssList(X9)
| ~ ssList(X8)
| ~ ssList(X7) ),
inference(equality_proxy_replacement,[],[f169,f174]) ).
tff(f169,plain,
! [X8: $i,X9: $i,X7: $i] :
( ( app(X7,X9) != sK3 )
| ( app(app(X7,X8),X9) != sK2 )
| ~ ssList(X9)
| ~ ssList(X8)
| ~ ssList(X7) ),
inference(definition_unfolding,[],[f140,f138,f139]) ).
tff(f139,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f125]) ).
tff(f138,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f125]) ).
tff(f140,plain,
! [X8: $i,X9: $i,X7: $i] :
( ( app(X7,X9) != sK1 )
| ( app(app(X7,X8),X9) != sK0 )
| ~ ssList(X9)
| ~ ssList(X8)
| ~ ssList(X7) ),
inference(cnf_transformation,[],[f125]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.10 % Problem : SWC095+1 : TPTP v8.1.2. Released v2.4.0.
% 0.09/0.11 % 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.10/0.31 % Computer : n020.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Tue Apr 30 18:14:17 EDT 2024
% 0.10/0.31 % CPUTime :
% 0.10/0.31 This is a FOF_THM_RFO_SEQ problem
% 0.10/0.31 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/tmp/tmp.8oX5ymXkf3/Vampire---4.8_4608
% 0.54/0.75 % (4735)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2995ds/45Mi)
% 0.54/0.75 % (4733)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2995ds/33Mi)
% 0.54/0.75 % (4736)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 Vampire---4 for (2995ds/83Mi)
% 0.54/0.75 % (4731)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 Vampire---4 for (2995ds/51Mi)
% 0.54/0.75 % (4730)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 Vampire---4 for (2995ds/34Mi)
% 0.54/0.75 % (4732)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2995ds/78Mi)
% 0.54/0.75 % (4737)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on Vampire---4 for (2995ds/56Mi)
% 0.54/0.75 % (4734)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 Vampire---4 for (2995ds/34Mi)
% 0.54/0.75 % (4730)First to succeed.
% 0.54/0.75 % (4732)Also succeeded, but the first one will report.
% 0.54/0.76 % (4730)Refutation found. Thanks to Tanya!
% 0.54/0.76 % SZS status Theorem for Vampire---4
% 0.54/0.76 % SZS output start Proof for Vampire---4
% See solution above
% 0.54/0.76 % (4730)------------------------------
% 0.54/0.76 % (4730)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.54/0.76 % (4730)Termination reason: Refutation
% 0.54/0.76
% 0.54/0.76 % (4730)Memory used [KB]: 1152
% 0.54/0.76 % (4730)Time elapsed: 0.005 s
% 0.54/0.76 % (4730)Instructions burned: 7 (million)
% 0.54/0.76 % (4730)------------------------------
% 0.54/0.76 % (4730)------------------------------
% 0.54/0.76 % (4722)Success in time 0.431 s
% 0.54/0.76 % Vampire---4.8 exiting
%------------------------------------------------------------------------------