TSTP Solution File: ALG203+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : ALG203+1 : TPTP v8.2.0. Released v2.7.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 : Mon May 20 18:19:18 EDT 2024
% Result : Theorem 0.74s 0.92s
% Output : Refutation 0.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 8
% Syntax : Number of formulae : 50 ( 8 unt; 0 def)
% Number of atoms : 201 ( 62 equ)
% Maximal formula atoms : 14 ( 4 avg)
% Number of connectives : 245 ( 94 ~; 73 |; 46 &)
% ( 3 <=>; 29 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 4 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 78 ( 68 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f118,plain,
$false,
inference(avatar_sat_refutation,[],[f79,f93,f110,f117]) ).
fof(f117,plain,
( ~ spl2_1
| ~ spl2_3 ),
inference(avatar_contradiction_clause,[],[f116]) ).
fof(f116,plain,
( $false
| ~ spl2_1
| ~ spl2_3 ),
inference(subsumption_resolution,[],[f113,f82]) ).
fof(f82,plain,
( sorti2(h(sK1))
| ~ spl2_3 ),
inference(avatar_component_clause,[],[f81]) ).
fof(f81,plain,
( spl2_3
<=> sorti2(h(sK1)) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_3])]) ).
fof(f113,plain,
( ~ sorti2(h(sK1))
| ~ spl2_1 ),
inference(trivial_inequality_removal,[],[f112]) ).
fof(f112,plain,
( h(sK1) != h(sK1)
| ~ sorti2(h(sK1))
| ~ spl2_1 ),
inference(superposition,[],[f75,f38]) ).
fof(f38,plain,
h(sK1) = op2(h(sK1),h(sK1)),
inference(subsumption_resolution,[],[f37,f26]) ).
fof(f26,plain,
sorti1(sK1),
inference(cnf_transformation,[],[f18]) ).
fof(f18,plain,
( sK0 != op1(sK0,sK0)
& sorti1(sK0)
& sK1 = op1(sK1,sK1)
& sorti1(sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f9,f17,f16]) ).
fof(f16,plain,
( ? [X0] :
( op1(X0,X0) != X0
& sorti1(X0) )
=> ( sK0 != op1(sK0,sK0)
& sorti1(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f17,plain,
( ? [X1] :
( op1(X1,X1) = X1
& sorti1(X1) )
=> ( sK1 = op1(sK1,sK1)
& sorti1(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f9,plain,
( ? [X0] :
( op1(X0,X0) != X0
& sorti1(X0) )
& ? [X1] :
( op1(X1,X1) = X1
& sorti1(X1) ) ),
inference(rectify,[],[f3]) ).
fof(f3,axiom,
( ? [X1] :
( op1(X1,X1) != X1
& sorti1(X1) )
& ? [X0] :
( op1(X0,X0) = X0
& sorti1(X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax3) ).
fof(f37,plain,
( h(sK1) = op2(h(sK1),h(sK1))
| ~ sorti1(sK1) ),
inference(duplicate_literal_removal,[],[f34]) ).
fof(f34,plain,
( h(sK1) = op2(h(sK1),h(sK1))
| ~ sorti1(sK1)
| ~ sorti1(sK1) ),
inference(superposition,[],[f21,f27]) ).
fof(f27,plain,
sK1 = op1(sK1,sK1),
inference(cnf_transformation,[],[f18]) ).
fof(f21,plain,
! [X4,X5] :
( h(op1(X4,X5)) = op2(h(X4),h(X5))
| ~ sorti1(X5)
| ~ sorti1(X4) ),
inference(cnf_transformation,[],[f15]) ).
fof(f15,plain,
( ! [X0] :
( j(h(X0)) = X0
| ~ sorti1(X0) )
& ! [X1] :
( h(j(X1)) = X1
| ~ sorti2(X1) )
& ! [X2] :
( ! [X3] :
( j(op2(X2,X3)) = op1(j(X2),j(X3))
| ~ sorti2(X3) )
| ~ sorti2(X2) )
& ! [X4] :
( ! [X5] :
( h(op1(X4,X5)) = op2(h(X4),h(X5))
| ~ sorti1(X5) )
| ~ sorti1(X4) )
& ! [X6] :
( sorti1(j(X6))
| ~ sorti2(X6) )
& ! [X7] :
( sorti2(h(X7))
| ~ sorti1(X7) ) ),
inference(rectify,[],[f11]) ).
fof(f11,plain,
( ! [X2] :
( j(h(X2)) = X2
| ~ sorti1(X2) )
& ! [X3] :
( h(j(X3)) = X3
| ~ sorti2(X3) )
& ! [X4] :
( ! [X5] :
( j(op2(X4,X5)) = op1(j(X4),j(X5))
| ~ sorti2(X5) )
| ~ sorti2(X4) )
& ! [X6] :
( ! [X7] :
( h(op1(X6,X7)) = op2(h(X6),h(X7))
| ~ sorti1(X7) )
| ~ sorti1(X6) )
& ! [X0] :
( sorti1(j(X0))
| ~ sorti2(X0) )
& ! [X1] :
( sorti2(h(X1))
| ~ sorti1(X1) ) ),
inference(flattening,[],[f10]) ).
fof(f10,plain,
( ! [X2] :
( j(h(X2)) = X2
| ~ sorti1(X2) )
& ! [X3] :
( h(j(X3)) = X3
| ~ sorti2(X3) )
& ! [X4] :
( ! [X5] :
( j(op2(X4,X5)) = op1(j(X4),j(X5))
| ~ sorti2(X5) )
| ~ sorti2(X4) )
& ! [X6] :
( ! [X7] :
( h(op1(X6,X7)) = op2(h(X6),h(X7))
| ~ sorti1(X7) )
| ~ sorti1(X6) )
& ! [X0] :
( sorti1(j(X0))
| ~ sorti2(X0) )
& ! [X1] :
( sorti2(h(X1))
| ~ sorti1(X1) ) ),
inference(ennf_transformation,[],[f7]) ).
fof(f7,plain,
~ ( ( ! [X0] :
( sorti2(X0)
=> sorti1(j(X0)) )
& ! [X1] :
( sorti1(X1)
=> sorti2(h(X1)) ) )
=> ~ ( ! [X2] :
( sorti1(X2)
=> j(h(X2)) = X2 )
& ! [X3] :
( sorti2(X3)
=> h(j(X3)) = X3 )
& ! [X4] :
( sorti2(X4)
=> ! [X5] :
( sorti2(X5)
=> j(op2(X4,X5)) = op1(j(X4),j(X5)) ) )
& ! [X6] :
( sorti1(X6)
=> ! [X7] :
( sorti1(X7)
=> h(op1(X6,X7)) = op2(h(X6),h(X7)) ) ) ) ),
inference(rectify,[],[f6]) ).
fof(f6,negated_conjecture,
~ ( ( ! [X1] :
( sorti2(X1)
=> sorti1(j(X1)) )
& ! [X0] :
( sorti1(X0)
=> sorti2(h(X0)) ) )
=> ~ ( ! [X7] :
( sorti1(X7)
=> j(h(X7)) = X7 )
& ! [X6] :
( sorti2(X6)
=> h(j(X6)) = X6 )
& ! [X4] :
( sorti2(X4)
=> ! [X5] :
( sorti2(X5)
=> j(op2(X4,X5)) = op1(j(X4),j(X5)) ) )
& ! [X2] :
( sorti1(X2)
=> ! [X3] :
( sorti1(X3)
=> h(op1(X2,X3)) = op2(h(X2),h(X3)) ) ) ) ),
inference(negated_conjecture,[],[f5]) ).
fof(f5,conjecture,
( ( ! [X1] :
( sorti2(X1)
=> sorti1(j(X1)) )
& ! [X0] :
( sorti1(X0)
=> sorti2(h(X0)) ) )
=> ~ ( ! [X7] :
( sorti1(X7)
=> j(h(X7)) = X7 )
& ! [X6] :
( sorti2(X6)
=> h(j(X6)) = X6 )
& ! [X4] :
( sorti2(X4)
=> ! [X5] :
( sorti2(X5)
=> j(op2(X4,X5)) = op1(j(X4),j(X5)) ) )
& ! [X2] :
( sorti1(X2)
=> ! [X3] :
( sorti1(X3)
=> h(op1(X2,X3)) = op2(h(X2),h(X3)) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f75,plain,
( ! [X1] :
( op2(X1,X1) != X1
| ~ sorti2(X1) )
| ~ spl2_1 ),
inference(avatar_component_clause,[],[f74]) ).
fof(f74,plain,
( spl2_1
<=> ! [X1] :
( op2(X1,X1) != X1
| ~ sorti2(X1) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_1])]) ).
fof(f110,plain,
~ spl2_2,
inference(avatar_contradiction_clause,[],[f109]) ).
fof(f109,plain,
( $false
| ~ spl2_2 ),
inference(subsumption_resolution,[],[f106,f28]) ).
fof(f28,plain,
sorti1(sK0),
inference(cnf_transformation,[],[f18]) ).
fof(f106,plain,
( ~ sorti1(sK0)
| ~ spl2_2 ),
inference(trivial_inequality_removal,[],[f105]) ).
fof(f105,plain,
( sK0 != sK0
| ~ sorti1(sK0)
| ~ spl2_2 ),
inference(superposition,[],[f29,f100]) ).
fof(f100,plain,
( ! [X0] :
( op1(X0,X0) = X0
| ~ sorti1(X0) )
| ~ spl2_2 ),
inference(subsumption_resolution,[],[f94,f19]) ).
fof(f19,plain,
! [X7] :
( sorti2(h(X7))
| ~ sorti1(X7) ),
inference(cnf_transformation,[],[f15]) ).
fof(f94,plain,
( ! [X0] :
( op1(X0,X0) = X0
| ~ sorti2(h(X0))
| ~ sorti1(X0) )
| ~ spl2_2 ),
inference(superposition,[],[f78,f24]) ).
fof(f24,plain,
! [X0] :
( j(h(X0)) = X0
| ~ sorti1(X0) ),
inference(cnf_transformation,[],[f15]) ).
fof(f78,plain,
( ! [X0] :
( j(X0) = op1(j(X0),j(X0))
| ~ sorti2(X0) )
| ~ spl2_2 ),
inference(avatar_component_clause,[],[f77]) ).
fof(f77,plain,
( spl2_2
<=> ! [X0] :
( j(X0) = op1(j(X0),j(X0))
| ~ sorti2(X0) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_2])]) ).
fof(f29,plain,
sK0 != op1(sK0,sK0),
inference(cnf_transformation,[],[f18]) ).
fof(f93,plain,
spl2_3,
inference(avatar_contradiction_clause,[],[f92]) ).
fof(f92,plain,
( $false
| spl2_3 ),
inference(subsumption_resolution,[],[f91,f26]) ).
fof(f91,plain,
( ~ sorti1(sK1)
| spl2_3 ),
inference(resolution,[],[f83,f19]) ).
fof(f83,plain,
( ~ sorti2(h(sK1))
| spl2_3 ),
inference(avatar_component_clause,[],[f81]) ).
fof(f79,plain,
( spl2_1
| spl2_2 ),
inference(avatar_split_clause,[],[f72,f77,f74]) ).
fof(f72,plain,
! [X0,X1] :
( j(X0) = op1(j(X0),j(X0))
| ~ sorti2(X0)
| op2(X1,X1) != X1
| ~ sorti2(X1) ),
inference(duplicate_literal_removal,[],[f67]) ).
fof(f67,plain,
! [X0,X1] :
( j(X0) = op1(j(X0),j(X0))
| ~ sorti2(X0)
| ~ sorti2(X0)
| ~ sorti2(X0)
| op2(X1,X1) != X1
| ~ sorti2(X1) ),
inference(superposition,[],[f22,f25]) ).
fof(f25,plain,
! [X0,X1] :
( op2(X0,X0) = X0
| ~ sorti2(X0)
| op2(X1,X1) != X1
| ~ sorti2(X1) ),
inference(cnf_transformation,[],[f12]) ).
fof(f12,plain,
( ! [X0] :
( op2(X0,X0) = X0
| ~ sorti2(X0) )
| ! [X1] :
( op2(X1,X1) != X1
| ~ sorti2(X1) ) ),
inference(ennf_transformation,[],[f8]) ).
fof(f8,plain,
~ ( ? [X0] :
( op2(X0,X0) != X0
& sorti2(X0) )
& ? [X1] :
( op2(X1,X1) = X1
& sorti2(X1) ) ),
inference(rectify,[],[f4]) ).
fof(f4,axiom,
~ ( ? [X1] :
( op2(X1,X1) != X1
& sorti2(X1) )
& ? [X0] :
( op2(X0,X0) = X0
& sorti2(X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax4) ).
fof(f22,plain,
! [X2,X3] :
( j(op2(X2,X3)) = op1(j(X2),j(X3))
| ~ sorti2(X3)
| ~ sorti2(X2) ),
inference(cnf_transformation,[],[f15]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : ALG203+1 : TPTP v8.2.0. Released v2.7.0.
% 0.12/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.14/0.35 % Computer : n014.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sat May 18 23:38:53 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.35 This is a FOF_THM_RFO_SEQ problem
% 0.14/0.36 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.74/0.91 % (28799)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2994ds/78Mi)
% 0.74/0.91 % (28801)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 (2994ds/34Mi)
% 0.74/0.91 % (28800)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2994ds/33Mi)
% 0.74/0.91 % (28798)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 (2994ds/51Mi)
% 0.74/0.91 % (28802)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2994ds/45Mi)
% 0.74/0.91 % (28803)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 (2994ds/83Mi)
% 0.74/0.91 % (28804)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 (2994ds/56Mi)
% 0.74/0.91 % (28797)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 (2994ds/34Mi)
% 0.74/0.91 % (28804)Refutation not found, incomplete strategy% (28804)------------------------------
% 0.74/0.91 % (28804)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.74/0.91 % (28804)Termination reason: Refutation not found, incomplete strategy
% 0.74/0.91
% 0.74/0.91 % (28804)Memory used [KB]: 969
% 0.74/0.91 % (28804)Time elapsed: 0.003 s
% 0.74/0.91 % (28804)Instructions burned: 2 (million)
% 0.74/0.91 % (28804)------------------------------
% 0.74/0.91 % (28804)------------------------------
% 0.74/0.91 % (28797)Refutation not found, incomplete strategy% (28797)------------------------------
% 0.74/0.91 % (28797)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.74/0.91 % (28797)Termination reason: Refutation not found, incomplete strategy
% 0.74/0.91
% 0.74/0.91 % (28797)Memory used [KB]: 972
% 0.74/0.91 % (28797)Time elapsed: 0.002 s
% 0.74/0.91 % (28797)Instructions burned: 3 (million)
% 0.74/0.92 % (28797)------------------------------
% 0.74/0.92 % (28797)------------------------------
% 0.74/0.92 % (28802)First to succeed.
% 0.74/0.92 % (28802)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-28796"
% 0.74/0.92 % (28802)Refutation found. Thanks to Tanya!
% 0.74/0.92 % SZS status Theorem for theBenchmark
% 0.74/0.92 % SZS output start Proof for theBenchmark
% See solution above
% 0.74/0.92 % (28802)------------------------------
% 0.74/0.92 % (28802)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.74/0.92 % (28802)Termination reason: Refutation
% 0.74/0.92
% 0.74/0.92 % (28802)Memory used [KB]: 1066
% 0.74/0.92 % (28802)Time elapsed: 0.005 s
% 0.74/0.92 % (28802)Instructions burned: 6 (million)
% 0.74/0.92 % (28796)Success in time 0.551 s
% 0.74/0.92 % Vampire---4.8 exiting
%------------------------------------------------------------------------------