TSTP Solution File: DAT010_1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : DAT010_1 : TPTP v8.1.2. Released v5.0.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 : n014.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 02:18:32 EDT 2024
% Result : Theorem 0.62s 0.77s
% Output : Refutation 0.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 14
% Syntax : Number of formulae : 54 ( 12 unt; 6 typ; 0 def)
% Number of atoms : 105 ( 53 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 88 ( 31 ~; 36 |; 14 &)
% ( 3 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 5 ( 1 avg)
% Number arithmetic : 221 ( 27 atm; 0 fun; 158 num; 36 var)
% Number of types : 2 ( 1 usr; 1 ari)
% Number of type conns : 5 ( 2 >; 3 *; 0 +; 0 <<)
% Number of predicates : 6 ( 3 usr; 4 prp; 0-2 aty)
% Number of functors : 13 ( 5 usr; 11 con; 0-3 aty)
% Number of variables : 53 ( 39 !; 14 ?; 53 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
array: $tType ).
tff(func_def_0,type,
read: ( array * $int ) > $int ).
tff(func_def_1,type,
write: ( array * $int * $int ) > array ).
tff(func_def_14,type,
sK0: array ).
tff(func_def_15,type,
sK1: array ).
tff(func_def_16,type,
sK2: $int ).
tff(f196,plain,
$false,
inference(avatar_sat_refutation,[],[f100,f129,f155,f182]) ).
tff(f182,plain,
~ spl3_5,
inference(avatar_contradiction_clause,[],[f181]) ).
tff(f181,plain,
( $false
| ~ spl3_5 ),
inference(evaluation,[],[f180]) ).
tff(f180,plain,
( ~ $less(44,100)
| ~ spl3_5 ),
inference(forward_demodulation,[],[f170,f51]) ).
tff(f51,plain,
44 = read(sK0,4),
inference(superposition,[],[f28,f24]) ).
tff(f24,plain,
sK0 = write(write(write(write(sK1,3,33),4,444),5,55),4,44),
inference(cnf_transformation,[],[f23]) ).
tff(f23,plain,
( ~ $less(read(sK0,sK2),100)
& ! [X3: $int] : $less(read(sK1,X3),100)
& ( sK0 = write(write(write(write(sK1,3,33),4,444),5,55),4,44) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f20,f22,f21]) ).
tff(f21,plain,
( ? [X0: array,X1: array] :
( ? [X2: $int] : ~ $less(read(X0,X2),100)
& ! [X3: $int] : $less(read(X1,X3),100)
& ( write(write(write(write(X1,3,33),4,444),5,55),4,44) = X0 ) )
=> ( ? [X2: $int] : ~ $less(read(sK0,X2),100)
& ! [X3: $int] : $less(read(sK1,X3),100)
& ( sK0 = write(write(write(write(sK1,3,33),4,444),5,55),4,44) ) ) ),
introduced(choice_axiom,[]) ).
tff(f22,plain,
( ? [X2: $int] : ~ $less(read(sK0,X2),100)
=> ~ $less(read(sK0,sK2),100) ),
introduced(choice_axiom,[]) ).
tff(f20,plain,
? [X0: array,X1: array] :
( ? [X2: $int] : ~ $less(read(X0,X2),100)
& ! [X3: $int] : $less(read(X1,X3),100)
& ( write(write(write(write(X1,3,33),4,444),5,55),4,44) = X0 ) ),
inference(rectify,[],[f19]) ).
tff(f19,plain,
? [X0: array,X1: array] :
( ? [X3: $int] : ~ $less(read(X0,X3),100)
& ! [X2: $int] : $less(read(X1,X2),100)
& ( write(write(write(write(X1,3,33),4,444),5,55),4,44) = X0 ) ),
inference(flattening,[],[f18]) ).
tff(f18,plain,
? [X0: array,X1: array] :
( ? [X3: $int] : ~ $less(read(X0,X3),100)
& ! [X2: $int] : $less(read(X1,X2),100)
& ( write(write(write(write(X1,3,33),4,444),5,55),4,44) = X0 ) ),
inference(ennf_transformation,[],[f4]) ).
tff(f4,negated_conjecture,
~ ! [X0: array,X1: array] :
( ( ! [X2: $int] : $less(read(X1,X2),100)
& ( write(write(write(write(X1,3,33),4,444),5,55),4,44) = X0 ) )
=> ! [X3: $int] : $less(read(X0,X3),100) ),
inference(negated_conjecture,[],[f3]) ).
tff(f3,conjecture,
! [X0: array,X1: array] :
( ( ! [X2: $int] : $less(read(X1,X2),100)
& ( write(write(write(write(X1,3,33),4,444),5,55),4,44) = X0 ) )
=> ! [X3: $int] : $less(read(X0,X3),100) ),
file('/export/starexec/sandbox/tmp/tmp.AsrQygIkex/Vampire---4.8_27918',co1) ).
tff(f28,plain,
! [X2: $int,X0: array,X1: $int] : ( read(write(X0,X1,X2),X1) = X2 ),
inference(cnf_transformation,[],[f1]) ).
tff(f1,axiom,
! [X0: array,X1: $int,X2: $int] : ( read(write(X0,X1,X2),X1) = X2 ),
file('/export/starexec/sandbox/tmp/tmp.AsrQygIkex/Vampire---4.8_27918',ax1) ).
tff(f170,plain,
( ~ $less(read(sK0,4),100)
| ~ spl3_5 ),
inference(superposition,[],[f26,f99]) ).
tff(f99,plain,
( ( 4 = sK2 )
| ~ spl3_5 ),
inference(avatar_component_clause,[],[f97]) ).
tff(f97,plain,
( spl3_5
<=> ( 4 = sK2 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_5])]) ).
tff(f26,plain,
~ $less(read(sK0,sK2),100),
inference(cnf_transformation,[],[f23]) ).
tff(f155,plain,
~ spl3_4,
inference(avatar_contradiction_clause,[],[f154]) ).
tff(f154,plain,
( $false
| ~ spl3_4 ),
inference(evaluation,[],[f153]) ).
tff(f153,plain,
( ~ $less(55,100)
| ~ spl3_4 ),
inference(forward_demodulation,[],[f143,f66]) ).
tff(f66,plain,
55 = read(sK0,5),
inference(evaluation,[],[f62]) ).
tff(f62,plain,
( ( 55 = read(sK0,5) )
| ( 4 = 5 ) ),
inference(superposition,[],[f52,f28]) ).
tff(f52,plain,
! [X0: $int] :
( ( read(write(write(write(sK1,3,33),4,444),5,55),X0) = read(sK0,X0) )
| ( 4 = X0 ) ),
inference(superposition,[],[f27,f24]) ).
tff(f27,plain,
! [X2: $int,X3: $int,X0: array,X1: $int] :
( ( read(write(X0,X1,X3),X2) = read(X0,X2) )
| ( X1 = X2 ) ),
inference(cnf_transformation,[],[f17]) ).
tff(f17,plain,
! [X0: array,X1: $int,X2: $int,X3: $int] :
( ( read(write(X0,X1,X3),X2) = read(X0,X2) )
| ( X1 = X2 ) ),
inference(rectify,[],[f2]) ).
tff(f2,axiom,
! [X3: array,X4: $int,X5: $int,X6: $int] :
( ( read(write(X3,X4,X6),X5) = read(X3,X5) )
| ( X4 = X5 ) ),
file('/export/starexec/sandbox/tmp/tmp.AsrQygIkex/Vampire---4.8_27918',ax2) ).
tff(f143,plain,
( ~ $less(read(sK0,5),100)
| ~ spl3_4 ),
inference(superposition,[],[f26,f95]) ).
tff(f95,plain,
( ( 5 = sK2 )
| ~ spl3_4 ),
inference(avatar_component_clause,[],[f93]) ).
tff(f93,plain,
( spl3_4
<=> ( 5 = sK2 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_4])]) ).
tff(f129,plain,
~ spl3_3,
inference(avatar_contradiction_clause,[],[f128]) ).
tff(f128,plain,
( $false
| ~ spl3_3 ),
inference(evaluation,[],[f127]) ).
tff(f127,plain,
( ~ $less(33,100)
| ~ spl3_3 ),
inference(forward_demodulation,[],[f118,f78]) ).
tff(f78,plain,
33 = read(sK0,3),
inference(evaluation,[],[f74]) ).
tff(f74,plain,
( ( 33 = read(sK0,3) )
| ( 3 = 4 )
| ( 3 = 5 ) ),
inference(superposition,[],[f72,f28]) ).
tff(f72,plain,
! [X0: $int] :
( ( read(sK0,X0) = read(write(sK1,3,33),X0) )
| ( 4 = X0 )
| ( 5 = X0 ) ),
inference(duplicate_literal_removal,[],[f67]) ).
tff(f67,plain,
! [X0: $int] :
( ( read(sK0,X0) = read(write(sK1,3,33),X0) )
| ( 4 = X0 )
| ( 5 = X0 )
| ( 4 = X0 ) ),
inference(superposition,[],[f61,f27]) ).
tff(f61,plain,
! [X0: $int] :
( ( read(sK0,X0) = read(write(write(sK1,3,33),4,444),X0) )
| ( 4 = X0 )
| ( 5 = X0 ) ),
inference(superposition,[],[f52,f27]) ).
tff(f118,plain,
( ~ $less(read(sK0,3),100)
| ~ spl3_3 ),
inference(superposition,[],[f26,f91]) ).
tff(f91,plain,
( ( 3 = sK2 )
| ~ spl3_3 ),
inference(avatar_component_clause,[],[f89]) ).
tff(f89,plain,
( spl3_3
<=> ( 3 = sK2 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_3])]) ).
tff(f100,plain,
( spl3_3
| spl3_4
| spl3_5 ),
inference(avatar_split_clause,[],[f80,f97,f93,f89]) ).
tff(f80,plain,
( ( 4 = sK2 )
| ( 5 = sK2 )
| ( 3 = sK2 ) ),
inference(resolution,[],[f79,f26]) ).
tff(f79,plain,
! [X0: $int] :
( $less(read(sK0,X0),100)
| ( 4 = X0 )
| ( 5 = X0 )
| ( 3 = X0 ) ),
inference(superposition,[],[f25,f73]) ).
tff(f73,plain,
! [X0: $int] :
( ( read(sK1,X0) = read(sK0,X0) )
| ( 4 = X0 )
| ( 5 = X0 )
| ( 3 = X0 ) ),
inference(superposition,[],[f72,f27]) ).
tff(f25,plain,
! [X3: $int] : $less(read(sK1,X3),100),
inference(cnf_transformation,[],[f23]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : DAT010_1 : TPTP v8.1.2. Released v5.0.0.
% 0.14/0.15 % 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.36 % Computer : n014.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Tue Apr 30 16:26:03 EDT 2024
% 0.15/0.37 % CPUTime :
% 0.15/0.37 This is a TF0_THM_EQU_ARI problem
% 0.15/0.37 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/tmp/tmp.AsrQygIkex/Vampire---4.8_27918
% 0.62/0.76 % (28323)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 (2996ds/56Mi)
% 0.62/0.76 % (28316)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.62/0.76 % (28318)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.62/0.76 % (28317)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.62/0.76 % (28319)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.62/0.76 % (28321)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.62/0.76 % (28320)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.62/0.76 % (28322)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 (2996ds/83Mi)
% 0.62/0.77 % (28321)First to succeed.
% 0.62/0.77 % (28321)Refutation found. Thanks to Tanya!
% 0.62/0.77 % SZS status Theorem for Vampire---4
% 0.62/0.77 % SZS output start Proof for Vampire---4
% See solution above
% 0.62/0.77 % (28321)------------------------------
% 0.62/0.77 % (28321)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.62/0.77 % (28321)Termination reason: Refutation
% 0.62/0.77
% 0.62/0.77 % (28321)Memory used [KB]: 1096
% 0.62/0.77 % (28321)Time elapsed: 0.008 s
% 0.62/0.77 % (28321)Instructions burned: 11 (million)
% 0.62/0.77 % (28321)------------------------------
% 0.62/0.77 % (28321)------------------------------
% 0.62/0.77 % (28163)Success in time 0.391 s
% 0.62/0.77 % Vampire---4.8 exiting
%------------------------------------------------------------------------------