TSTP Solution File: SWC385+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC385+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 : 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 : Sun May 5 09:50:45 EDT 2024
% Result : Theorem 0.53s 0.75s
% Output : Refutation 0.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 9
% Syntax : Number of formulae : 26 ( 8 unt; 1 typ; 0 def)
% Number of atoms : 286 ( 28 equ)
% Maximal formula atoms : 24 ( 11 avg)
% Number of connectives : 195 ( 52 ~; 37 |; 91 &)
% ( 3 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 6 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 118 ( 118 fml; 0 var)
% Number of types : 1 ( 0 usr)
% Number of type conns : 2 ( 1 >; 1 *; 0 +; 0 <<)
% Number of predicates : 15 ( 13 usr; 9 prp; 0-3 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 33 ( 8 !; 24 ?; 1 :)
% ( 1 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
tff(pred_def_20,type,
sQ11_eqProxy:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(f280,plain,
$false,
inference(avatar_sat_refutation,[],[f257,f262,f263,f264]) ).
tff(f264,plain,
spl12_3,
inference(avatar_split_clause,[],[f209,f259]) ).
tff(f259,plain,
( spl12_3
<=> neq(sK3,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl12_3])]) ).
tff(f209,plain,
neq(sK3,nil),
inference(definition_unfolding,[],[f162,f160]) ).
tff(f160,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f135]) ).
tff(f135,plain,
( ( ~ segmentP(sK1,sK0)
| ~ singletonP(sK0) )
& ( ~ neq(sK3,nil)
| singletonP(sK2) )
& segmentP(sK3,sK2)
& neq(sK1,nil)
& ( sK0 = sK2 )
& ( sK1 = sK3 )
& ssList(sK3)
& ssList(sK2)
& ssList(sK1)
& ssList(sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f99,f134,f133,f132,f131]) ).
tff(f131,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ segmentP(X1,X0)
| ~ singletonP(X0) )
& ( ~ neq(X3,nil)
| singletonP(X2) )
& segmentP(X3,X2)
& neq(X1,nil)
& ( X0 = X2 )
& ( X1 = X3 )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ segmentP(X1,sK0)
| ~ singletonP(sK0) )
& ( ~ neq(X3,nil)
| singletonP(X2) )
& segmentP(X3,X2)
& neq(X1,nil)
& ( sK0 = X2 )
& ( X1 = X3 )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK0) ) ),
introduced(choice_axiom,[]) ).
tff(f132,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ segmentP(X1,sK0)
| ~ singletonP(sK0) )
& ( ~ neq(X3,nil)
| singletonP(X2) )
& segmentP(X3,X2)
& neq(X1,nil)
& ( sK0 = X2 )
& ( X1 = X3 )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ~ segmentP(sK1,sK0)
| ~ singletonP(sK0) )
& ( ~ neq(X3,nil)
| singletonP(X2) )
& segmentP(X3,X2)
& neq(sK1,nil)
& ( sK0 = X2 )
& ( sK1 = X3 )
& ssList(X3) )
& ssList(X2) )
& ssList(sK1) ) ),
introduced(choice_axiom,[]) ).
tff(f133,plain,
( ? [X2] :
( ? [X3] :
( ( ~ segmentP(sK1,sK0)
| ~ singletonP(sK0) )
& ( ~ neq(X3,nil)
| singletonP(X2) )
& segmentP(X3,X2)
& neq(sK1,nil)
& ( sK0 = X2 )
& ( sK1 = X3 )
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ~ segmentP(sK1,sK0)
| ~ singletonP(sK0) )
& ( ~ neq(X3,nil)
| singletonP(sK2) )
& segmentP(X3,sK2)
& neq(sK1,nil)
& ( sK0 = sK2 )
& ( sK1 = X3 )
& ssList(X3) )
& ssList(sK2) ) ),
introduced(choice_axiom,[]) ).
tff(f134,plain,
( ? [X3] :
( ( ~ segmentP(sK1,sK0)
| ~ singletonP(sK0) )
& ( ~ neq(X3,nil)
| singletonP(sK2) )
& segmentP(X3,sK2)
& neq(sK1,nil)
& ( sK0 = sK2 )
& ( sK1 = X3 )
& ssList(X3) )
=> ( ( ~ segmentP(sK1,sK0)
| ~ singletonP(sK0) )
& ( ~ neq(sK3,nil)
| singletonP(sK2) )
& segmentP(sK3,sK2)
& neq(sK1,nil)
& ( sK0 = sK2 )
& ( sK1 = sK3 )
& ssList(sK3) ) ),
introduced(choice_axiom,[]) ).
tff(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ segmentP(X1,X0)
| ~ singletonP(X0) )
& ( ~ neq(X3,nil)
| singletonP(X2) )
& segmentP(X3,X2)
& neq(X1,nil)
& ( X0 = X2 )
& ( X1 = X3 )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f98]) ).
tff(f98,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ segmentP(X1,X0)
| ~ singletonP(X0) )
& ( ~ neq(X3,nil)
| singletonP(X2) )
& segmentP(X3,X2)
& neq(X1,nil)
& ( X0 = X2 )
& ( X1 = X3 )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
tff(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( segmentP(X1,X0)
& singletonP(X0) )
| ( neq(X3,nil)
& ~ singletonP(X2) )
| ~ segmentP(X3,X2)
| ~ neq(X1,nil)
| ( X0 != X2 )
| ( X1 != X3 ) ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
tff(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( segmentP(X1,X0)
& singletonP(X0) )
| ( neq(X3,nil)
& ~ singletonP(X2) )
| ~ segmentP(X3,X2)
| ~ neq(X1,nil)
| ( X0 != X2 )
| ( X1 != X3 ) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.LQF3d5w0yU/Vampire---4.8_5144',co1) ).
tff(f162,plain,
neq(sK1,nil),
inference(cnf_transformation,[],[f135]) ).
tff(f263,plain,
spl12_2,
inference(avatar_split_clause,[],[f163,f254]) ).
tff(f254,plain,
( spl12_2
<=> segmentP(sK3,sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl12_2])]) ).
tff(f163,plain,
segmentP(sK3,sK2),
inference(cnf_transformation,[],[f135]) ).
tff(f262,plain,
( spl12_1
| ~ spl12_3 ),
inference(avatar_split_clause,[],[f164,f259,f250]) ).
tff(f250,plain,
( spl12_1
<=> singletonP(sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl12_1])]) ).
tff(f164,plain,
( ~ neq(sK3,nil)
| singletonP(sK2) ),
inference(cnf_transformation,[],[f135]) ).
tff(f257,plain,
( ~ spl12_1
| ~ spl12_2 ),
inference(avatar_split_clause,[],[f208,f254,f250]) ).
tff(f208,plain,
( ~ segmentP(sK3,sK2)
| ~ singletonP(sK2) ),
inference(definition_unfolding,[],[f165,f160,f161,f161]) ).
tff(f161,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f135]) ).
tff(f165,plain,
( ~ segmentP(sK1,sK0)
| ~ singletonP(sK0) ),
inference(cnf_transformation,[],[f135]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : SWC385+1 : TPTP v8.1.2. Released v2.4.0.
% 0.11/0.15 % 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.14/0.37 % Computer : n005.cluster.edu
% 0.14/0.37 % Model : x86_64 x86_64
% 0.14/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.37 % Memory : 8042.1875MB
% 0.14/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.37 % CPULimit : 300
% 0.14/0.37 % WCLimit : 300
% 0.14/0.37 % DateTime : Fri May 3 20:31:53 EDT 2024
% 0.14/0.37 % CPUTime :
% 0.14/0.37 This is a FOF_THM_RFO_SEQ problem
% 0.14/0.37 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.LQF3d5w0yU/Vampire---4.8_5144
% 0.53/0.75 % (5253)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 (2996ds/34Mi)
% 0.53/0.75 % (5255)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2996ds/78Mi)
% 0.53/0.75 % (5256)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2996ds/33Mi)
% 0.53/0.75 % (5257)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 (2996ds/34Mi)
% 0.53/0.75 % (5254)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 (2996ds/51Mi)
% 0.53/0.75 % (5258)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2996ds/45Mi)
% 0.53/0.75 % (5253)First to succeed.
% 0.53/0.75 % (5253)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-5252"
% 0.53/0.75 % (5256)Also succeeded, but the first one will report.
% 0.53/0.75 % (5258)Also succeeded, but the first one will report.
% 0.53/0.75 % (5255)Also succeeded, but the first one will report.
% 0.53/0.75 % (5253)Refutation found. Thanks to Tanya!
% 0.53/0.75 % SZS status Theorem for Vampire---4
% 0.53/0.75 % SZS output start Proof for Vampire---4
% See solution above
% 0.53/0.75 % (5253)------------------------------
% 0.53/0.75 % (5253)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.53/0.75 % (5253)Termination reason: Refutation
% 0.53/0.75
% 0.53/0.75 % (5253)Memory used [KB]: 1141
% 0.53/0.75 % (5253)Time elapsed: 0.003 s
% 0.53/0.75 % (5253)Instructions burned: 6 (million)
% 0.53/0.75 % (5252)Success in time 0.373 s
% 0.53/0.75 % Vampire---4.8 exiting
%------------------------------------------------------------------------------