TSTP Solution File: SWW679_1 by Vampire-SAT---4.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.9
% Problem : SWW679_1 : TPTP v8.2.0. Released v6.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire %s %d SAT
% 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 : Mon Jun 24 18:54:03 EDT 2024
% Result : Theorem 0.21s 0.43s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of formulae : 32 ( 6 unt; 0 typ; 0 def)
% Number of atoms : 144 ( 46 equ)
% Maximal formula atoms : 13 ( 4 avg)
% Number of connectives : 163 ( 51 ~; 35 |; 38 &)
% ( 6 <=>; 33 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number arithmetic : 28 ( 16 atm; 0 fun; 0 num; 12 var)
% Number of types : 3 ( 1 usr; 1 ari)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 10 ( 4 usr; 4 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 3 con; 0-3 aty)
% Number of variables : 33 ( 25 !; 8 ?; 33 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
'Tree': $tType ).
tff(func_def_0,type,
'empty:Tree': 'Tree' ).
tff(func_def_1,type,
'left:(Tree)>Tree': 'Tree' > 'Tree' ).
tff(func_def_2,type,
'val:(Tree)>Int': 'Tree' > $int ).
tff(func_def_3,type,
'node:(Int*Tree*Tree)>Tree': ( $int * 'Tree' * 'Tree' ) > 'Tree' ).
tff(func_def_4,type,
'right:(Tree)>Tree': 'Tree' > 'Tree' ).
tff(func_def_9,type,
sK0: 'Tree' ).
tff(func_def_10,type,
sK1: $int ).
tff(func_def_11,type,
sK2: 'Tree' > $int ).
tff(func_def_12,type,
sK3: 'Tree' > $int ).
tff(pred_def_1,type,
searchtree: 'Tree' > $o ).
tff(pred_def_2,type,
in: ( $int * 'Tree' ) > $o ).
tff(f178,plain,
$false,
inference(avatar_sat_refutation,[],[f120,f167,f176]) ).
tff(f176,plain,
spl4_3,
inference(avatar_contradiction_clause,[],[f175]) ).
tff(f175,plain,
( $false
| spl4_3 ),
inference(subsumption_resolution,[],[f174,f49]) ).
tff(f49,plain,
searchtree(sK0),
inference(cnf_transformation,[],[f30]) ).
tff(f30,plain,
? [X0: 'Tree',X1: $int] :
( ( ( ( ( ( ( ! [X2: 'Tree'] :
( ~ searchtree(X2)
| ( 'right:(Tree)>Tree'(X0) != X2 ) )
& ~ $less(X1,'val:(Tree)>Int'(X0)) )
| ( ! [X3: 'Tree'] :
( ~ searchtree(X3)
| ( 'left:(Tree)>Tree'(X0) != X3 ) )
& $less(X1,'val:(Tree)>Int'(X0)) ) )
& ( 'val:(Tree)>Int'(X0) != X1 ) )
| ( $false
& ( 'val:(Tree)>Int'(X0) = X1 ) ) )
& ( 'empty:Tree' != X0 ) )
| ( $false
& ( 'empty:Tree' = X0 ) ) )
& searchtree(X0) ),
inference(ennf_transformation,[],[f23]) ).
tff(f23,plain,
~ ! [X0: 'Tree',X1: $int] :
( searchtree(X0)
=> ( ( ( 'empty:Tree' != X0 )
=> ( ( ( 'val:(Tree)>Int'(X0) != X1 )
=> ( ( ~ $less(X1,'val:(Tree)>Int'(X0))
=> ? [X2: 'Tree'] :
( searchtree(X2)
& ( 'right:(Tree)>Tree'(X0) = X2 ) ) )
& ( $less(X1,'val:(Tree)>Int'(X0))
=> ? [X3: 'Tree'] :
( searchtree(X3)
& ( 'left:(Tree)>Tree'(X0) = X3 ) ) ) ) )
& ( ( 'val:(Tree)>Int'(X0) = X1 )
=> $true ) ) )
& ( ( 'empty:Tree' = X0 )
=> $true ) ) ),
inference(rectify,[],[f9]) ).
tff(f9,negated_conjecture,
~ ! [X5: 'Tree',X4: $int] :
( searchtree(X5)
=> ( ( ( 'empty:Tree' != X5 )
=> ( ( ( 'val:(Tree)>Int'(X5) != X4 )
=> ( ( ~ $less(X4,'val:(Tree)>Int'(X5))
=> ? [X7: 'Tree'] :
( searchtree(X7)
& ( 'right:(Tree)>Tree'(X5) = X7 ) ) )
& ( $less(X4,'val:(Tree)>Int'(X5))
=> ? [X6: 'Tree'] :
( searchtree(X6)
& ( 'left:(Tree)>Tree'(X5) = X6 ) ) ) ) )
& ( ( 'val:(Tree)>Int'(X5) = X4 )
=> $true ) ) )
& ( ( 'empty:Tree' = X5 )
=> $true ) ) ),
inference(negated_conjecture,[],[f8]) ).
tff(f8,conjecture,
! [X5: 'Tree',X4: $int] :
( searchtree(X5)
=> ( ( ( 'empty:Tree' != X5 )
=> ( ( ( 'val:(Tree)>Int'(X5) != X4 )
=> ( ( ~ $less(X4,'val:(Tree)>Int'(X5))
=> ? [X7: 'Tree'] :
( searchtree(X7)
& ( 'right:(Tree)>Tree'(X5) = X7 ) ) )
& ( $less(X4,'val:(Tree)>Int'(X5))
=> ? [X6: 'Tree'] :
( searchtree(X6)
& ( 'left:(Tree)>Tree'(X5) = X6 ) ) ) ) )
& ( ( 'val:(Tree)>Int'(X5) = X4 )
=> $true ) ) )
& ( ( 'empty:Tree' = X5 )
=> $true ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',unknown) ).
tff(f174,plain,
( ~ searchtree(sK0)
| spl4_3 ),
inference(subsumption_resolution,[],[f172,f48]) ).
tff(f48,plain,
'empty:Tree' != sK0,
inference(cnf_transformation,[],[f30]) ).
tff(f172,plain,
( ( 'empty:Tree' = sK0 )
| ~ searchtree(sK0)
| spl4_3 ),
inference(resolution,[],[f62,f112]) ).
tff(f112,plain,
( ~ searchtree('right:(Tree)>Tree'(sK0))
| spl4_3 ),
inference(avatar_component_clause,[],[f110]) ).
tff(f110,plain,
( spl4_3
<=> searchtree('right:(Tree)>Tree'(sK0)) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_3])]) ).
tff(f62,plain,
! [X0: 'Tree'] :
( searchtree('right:(Tree)>Tree'(X0))
| ( 'empty:Tree' = X0 )
| ~ searchtree(X0) ),
inference(cnf_transformation,[],[f31]) ).
tff(f31,plain,
! [X0: 'Tree'] :
( searchtree(X0)
<=> ( ( ( ! [X1: $int] :
( $less('val:(Tree)>Int'(X0),X1)
| ~ in(X1,'right:(Tree)>Tree'(X0)) )
& ! [X2: $int] :
( ~ $less('val:(Tree)>Int'(X0),X2)
| ~ in(X2,'left:(Tree)>Tree'(X0)) )
& searchtree('right:(Tree)>Tree'(X0))
& searchtree('left:(Tree)>Tree'(X0)) )
| ( 'empty:Tree' = X0 ) )
& ( $true
| ( 'empty:Tree' != X0 ) ) ) ),
inference(ennf_transformation,[],[f24]) ).
tff(f24,plain,
! [X0: 'Tree'] :
( searchtree(X0)
<=> ( ( ( 'empty:Tree' != X0 )
=> ( ! [X1: $int] :
( in(X1,'right:(Tree)>Tree'(X0))
=> $less('val:(Tree)>Int'(X0),X1) )
& ! [X2: $int] :
( in(X2,'left:(Tree)>Tree'(X0))
=> ~ $less('val:(Tree)>Int'(X0),X2) )
& searchtree('right:(Tree)>Tree'(X0))
& searchtree('left:(Tree)>Tree'(X0)) ) )
& ( ( 'empty:Tree' = X0 )
=> $true ) ) ),
inference(rectify,[],[f10]) ).
tff(f10,plain,
! [X5: 'Tree'] :
( searchtree(X5)
<=> ( ( ( 'empty:Tree' != X5 )
=> ( ! [X4: $int] :
( in(X4,'right:(Tree)>Tree'(X5))
=> $less('val:(Tree)>Int'(X5),X4) )
& ! [X4: $int] :
( in(X4,'left:(Tree)>Tree'(X5))
=> ~ $less('val:(Tree)>Int'(X5),X4) )
& searchtree('right:(Tree)>Tree'(X5))
& searchtree('left:(Tree)>Tree'(X5)) ) )
& ( ( 'empty:Tree' = X5 )
=> $true ) ) ),
inference(theory_normalization,[],[f7]) ).
tff(f7,axiom,
! [X5: 'Tree'] :
( searchtree(X5)
<=> ( ( ( 'empty:Tree' != X5 )
=> ( ! [X4: $int] :
( in(X4,'right:(Tree)>Tree'(X5))
=> $greater(X4,'val:(Tree)>Int'(X5)) )
& ! [X4: $int] :
( in(X4,'left:(Tree)>Tree'(X5))
=> $lesseq(X4,'val:(Tree)>Int'(X5)) )
& searchtree('right:(Tree)>Tree'(X5))
& searchtree('left:(Tree)>Tree'(X5)) ) )
& ( ( 'empty:Tree' = X5 )
=> $true ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',unknown) ).
tff(f167,plain,
spl4_2,
inference(avatar_contradiction_clause,[],[f166]) ).
tff(f166,plain,
( $false
| spl4_2 ),
inference(subsumption_resolution,[],[f165,f49]) ).
tff(f165,plain,
( ~ searchtree(sK0)
| spl4_2 ),
inference(subsumption_resolution,[],[f163,f48]) ).
tff(f163,plain,
( ( 'empty:Tree' = sK0 )
| ~ searchtree(sK0)
| spl4_2 ),
inference(resolution,[],[f61,f101]) ).
tff(f101,plain,
( ~ searchtree('left:(Tree)>Tree'(sK0))
| spl4_2 ),
inference(avatar_component_clause,[],[f99]) ).
tff(f99,plain,
( spl4_2
<=> searchtree('left:(Tree)>Tree'(sK0)) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_2])]) ).
tff(f61,plain,
! [X0: 'Tree'] :
( searchtree('left:(Tree)>Tree'(X0))
| ( 'empty:Tree' = X0 )
| ~ searchtree(X0) ),
inference(cnf_transformation,[],[f31]) ).
tff(f120,plain,
( ~ spl4_3
| ~ spl4_2 ),
inference(avatar_split_clause,[],[f119,f99,f110]) ).
tff(f119,plain,
( ~ searchtree('left:(Tree)>Tree'(sK0))
| ~ searchtree('right:(Tree)>Tree'(sK0)) ),
inference(subsumption_resolution,[],[f84,f92]) ).
tff(f92,plain,
sK1 != 'val:(Tree)>Int'(sK0),
inference(subsumption_resolution,[],[f47,f48]) ).
tff(f47,plain,
( ( 'empty:Tree' = sK0 )
| ( sK1 != 'val:(Tree)>Int'(sK0) ) ),
inference(cnf_transformation,[],[f30]) ).
tff(f84,plain,
( ( sK1 = 'val:(Tree)>Int'(sK0) )
| ~ searchtree('left:(Tree)>Tree'(sK0))
| ~ searchtree('right:(Tree)>Tree'(sK0)) ),
inference(equality_resolution,[],[f83]) ).
tff(f83,plain,
! [X2: 'Tree'] :
( ( sK1 = 'val:(Tree)>Int'(sK0) )
| ~ searchtree('left:(Tree)>Tree'(sK0))
| ( 'right:(Tree)>Tree'(sK0) != X2 )
| ~ searchtree(X2) ),
inference(equality_resolution,[],[f38]) ).
tff(f38,plain,
! [X2: 'Tree',X3: 'Tree'] :
( ( sK1 = 'val:(Tree)>Int'(sK0) )
| ( 'left:(Tree)>Tree'(sK0) != X3 )
| ~ searchtree(X3)
| ( 'right:(Tree)>Tree'(sK0) != X2 )
| ~ searchtree(X2) ),
inference(cnf_transformation,[],[f30]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWW679_1 : TPTP v8.2.0. Released v6.4.0.
% 0.03/0.12 % Command : run_vampire %s %d SAT
% 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 : Wed Jun 19 06:55:24 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.20/0.35 This is a TF0_THM_EQU_ARI problem
% 0.20/0.36 Running first-order model finding
% 0.20/0.36 Running /export/starexec/sandbox/solver/bin/vampire --mode casc_sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.42 % (1159)Running in auto input_syntax mode. Trying TPTP
% 0.20/0.42 % (1161)ott+10_10:1_add=off:afr=on:amm=off:anc=all:bd=off:bs=on:fsr=off:irw=on:lma=on:msp=off:nm=4:nwc=4.0:sac=on:sp=reverse_frequency:i=99418_0 on theBenchmark for (3000ds/99418Mi)
% 0.20/0.42 % (1159)Running in auto input_syntax mode. Trying TPTP
% 0.20/0.42 % (1164)ott+21_1:1_sil=4000:i=104:fsd=on:fd=off:newcnf=on_0 on theBenchmark for (3000ds/104Mi)
% 0.20/0.42 % (1159)Running in auto input_syntax mode. Trying TPTP
% 0.20/0.42 % (1165)ott+11_8:59_sil=16000:sp=occurrence:lsd=20:abs=on:i=146:aac=none:nm=16:fdi=10:rawr=on:nicw=on_0 on theBenchmark for (3000ds/146Mi)
% 0.20/0.42 % (1159)Running in auto input_syntax mode. Trying TPTP
% 0.20/0.42 % (1166)ott-4_1:1_sil=4000:sp=reverse_arity:lcm=predicate:newcnf=on:i=115:bce=on:fd=off:fs=off:fsr=off_0 on theBenchmark for (3000ds/115Mi)
% 0.20/0.42 % (1159)Running in auto input_syntax mode. Trying TPTP
% 0.20/0.42 % (1162)fmb+10_1:1_sil=256000:fmbes=contour:i=214858:bce=on_0 on theBenchmark for (3000ds/214858Mi)
% 0.20/0.42 % (1159)Running in auto input_syntax mode. Trying TPTP
% 0.20/0.42 % (1163)fmb+10_1:1_sil=256000:fmbss=23:fmbes=contour:newcnf=on:fmbsr=1.14:i=152523:nm=2:gsp=on:rp=on_0 on theBenchmark for (3000ds/152523Mi)
% 0.20/0.42 % (1159)Running in auto input_syntax mode. Trying TPTP
% 0.20/0.42 % (1160)fmb+10_1:1_sil=256000:i=98885:tgt=full:fmbsr=1.3:fmbss=10_0 on theBenchmark for (3000ds/98885Mi)
% 0.20/0.43 % (1160)WARNING: trying to run FMB on interpreted or otherwise provably infinite-domain problem!
% 0.20/0.43 % (1160)Terminated due to inappropriate strategy.
% 0.20/0.43 % (1160)------------------------------
% 0.20/0.43 % (1160)Version: Vampire 4.9 (commit 18c118a85 on 2024-06-08 21:14:20 +0100)
% 0.20/0.43 % (1160)Linked with Z3 4.12.3.0 79bbbf76d0c123481c8ca05cd3a98939270074d3 z3-4.8.4-7980-g79bbbf76d
% 0.20/0.43 % (1160)Termination reason: Inappropriate
% 0.20/0.43 % (1163)WARNING: trying to run FMB on interpreted or otherwise provably infinite-domain problem!
% 0.20/0.43
% 0.20/0.43 % (1160)Memory used [KB]: 749
% 0.20/0.43 % (1160)Time elapsed: 0.003 s
% 0.20/0.43 % (1160)Instructions burned: 2 (million)
% 0.20/0.43 % (1163)Terminated due to inappropriate strategy.
% 0.20/0.43 % (1163)------------------------------
% 0.20/0.43 % (1163)Version: Vampire 4.9 (commit 18c118a85 on 2024-06-08 21:14:20 +0100)
% 0.20/0.43 % (1163)Linked with Z3 4.12.3.0 79bbbf76d0c123481c8ca05cd3a98939270074d3 z3-4.8.4-7980-g79bbbf76d
% 0.20/0.43 % (1163)Termination reason: Inappropriate
% 0.20/0.43
% 0.20/0.43 % (1162)WARNING: trying to run FMB on interpreted or otherwise provably infinite-domain problem!
% 0.20/0.43 % (1163)Memory used [KB]: 686
% 0.20/0.43 % (1163)Time elapsed: 0.004 s
% 0.20/0.43 % (1163)Instructions burned: 3 (million)
% 0.20/0.43 % (1162)Terminated due to inappropriate strategy.
% 0.20/0.43 % (1162)------------------------------
% 0.20/0.43 % (1162)Version: Vampire 4.9 (commit 18c118a85 on 2024-06-08 21:14:20 +0100)
% 0.20/0.43 % (1162)Linked with Z3 4.12.3.0 79bbbf76d0c123481c8ca05cd3a98939270074d3 z3-4.8.4-7980-g79bbbf76d
% 0.20/0.43 % (1162)Termination reason: Inappropriate
% 0.20/0.43
% 0.20/0.43 % (1162)Memory used [KB]: 749
% 0.20/0.43 % (1162)Time elapsed: 0.004 s
% 0.20/0.43 % (1162)Instructions burned: 3 (million)
% 0.20/0.43 % (1160)------------------------------
% 0.20/0.43 % (1160)------------------------------
% 0.20/0.43 % (1163)------------------------------
% 0.20/0.43 % (1163)------------------------------
% 0.20/0.43 % (1162)------------------------------
% 0.20/0.43 % (1162)------------------------------
% 0.21/0.43 % (1166)Also succeeded, but the first one will report.
% 0.21/0.43 % (1164)First to succeed.
% 0.21/0.43 % (1164)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-1159"
% 0.21/0.43 % (1161)Also succeeded, but the first one will report.
% 0.21/0.43 % (1165)Also succeeded, but the first one will report.
% 0.21/0.43 % (1159)Running in auto input_syntax mode. Trying TPTP
% 0.21/0.43 % (1164)Refutation found. Thanks to Tanya!
% 0.21/0.43 % SZS status Theorem for theBenchmark
% 0.21/0.43 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.43 % (1164)------------------------------
% 0.21/0.43 % (1164)Version: Vampire 4.9 (commit 18c118a85 on 2024-06-08 21:14:20 +0100)
% 0.21/0.43 % (1164)Linked with Z3 4.12.3.0 79bbbf76d0c123481c8ca05cd3a98939270074d3 z3-4.8.4-7980-g79bbbf76d
% 0.21/0.43 % (1164)Termination reason: Refutation
% 0.21/0.43
% 0.21/0.43 % (1164)Memory used [KB]: 845
% 0.21/0.43 % (1164)Time elapsed: 0.009 s
% 0.21/0.43 % (1164)Instructions burned: 8 (million)
% 0.21/0.43 % (1164)------------------------------
% 0.21/0.43 % (1164)------------------------------
% 0.21/0.43 % (1159)Success in time 0.069 s
%------------------------------------------------------------------------------