TSTP Solution File: ALG177+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : ALG177+1 : TPTP v8.1.2. 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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n009.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 04:12:04 EDT 2024
% Result : Theorem 0.54s 0.75s
% Output : Refutation 0.54s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 5
% Syntax : Number of formulae : 34 ( 6 unt; 0 def)
% Number of atoms : 152 ( 44 equ)
% Maximal formula atoms : 14 ( 4 avg)
% Number of connectives : 187 ( 69 ~; 50 |; 37 &)
% ( 0 <=>; 31 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 1 con; 0-2 aty)
% Number of variables : 76 ( 70 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f102,plain,
$false,
inference(subsumption_resolution,[],[f101,f27]) ).
fof(f27,plain,
sorti1(sK1),
inference(cnf_transformation,[],[f18]) ).
fof(f18,plain,
( ! [X1] :
( op1(sK1,X1) != X1
| ~ sorti1(X1) )
& sorti1(sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f11,f17]) ).
fof(f17,plain,
( ? [X0] :
( ! [X1] :
( op1(X0,X1) != X1
| ~ sorti1(X1) )
& sorti1(X0) )
=> ( ! [X1] :
( op1(sK1,X1) != X1
| ~ sorti1(X1) )
& sorti1(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f11,plain,
? [X0] :
( ! [X1] :
( op1(X0,X1) != X1
| ~ sorti1(X1) )
& sorti1(X0) ),
inference(ennf_transformation,[],[f3]) ).
fof(f3,axiom,
? [X0] :
( ! [X1] :
( sorti1(X1)
=> op1(X0,X1) != X1 )
& sorti1(X0) ),
file('/export/starexec/sandbox2/tmp/tmp.UGVVIQjgBR/Vampire---4.8_26689',ax3) ).
fof(f101,plain,
~ sorti1(sK1),
inference(resolution,[],[f100,f19]) ).
fof(f19,plain,
! [X7] :
( sorti2(h(X7))
| ~ sorti1(X7) ),
inference(cnf_transformation,[],[f14]) ).
fof(f14,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,[],[f9]) ).
fof(f9,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,[],[f8]) ).
fof(f8,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/sandbox2/tmp/tmp.UGVVIQjgBR/Vampire---4.8_26689',co1) ).
fof(f100,plain,
~ sorti2(h(sK1)),
inference(resolution,[],[f99,f25]) ).
fof(f25,plain,
! [X0] :
( sorti2(sK0(X0))
| ~ sorti2(X0) ),
inference(cnf_transformation,[],[f16]) ).
fof(f16,plain,
! [X0] :
( ( sK0(X0) = op2(X0,sK0(X0))
& sorti2(sK0(X0)) )
| ~ sorti2(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f10,f15]) ).
fof(f15,plain,
! [X0] :
( ? [X1] :
( op2(X0,X1) = X1
& sorti2(X1) )
=> ( sK0(X0) = op2(X0,sK0(X0))
& sorti2(sK0(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f10,plain,
! [X0] :
( ? [X1] :
( op2(X0,X1) = X1
& sorti2(X1) )
| ~ sorti2(X0) ),
inference(ennf_transformation,[],[f4]) ).
fof(f4,axiom,
~ ? [X0] :
( ! [X1] :
( sorti2(X1)
=> op2(X0,X1) != X1 )
& sorti2(X0) ),
file('/export/starexec/sandbox2/tmp/tmp.UGVVIQjgBR/Vampire---4.8_26689',ax4) ).
fof(f99,plain,
~ sorti2(sK0(h(sK1))),
inference(resolution,[],[f98,f20]) ).
fof(f20,plain,
! [X6] :
( sorti1(j(X6))
| ~ sorti2(X6) ),
inference(cnf_transformation,[],[f14]) ).
fof(f98,plain,
~ sorti1(j(sK0(h(sK1)))),
inference(subsumption_resolution,[],[f96,f27]) ).
fof(f96,plain,
( ~ sorti1(j(sK0(h(sK1))))
| ~ sorti1(sK1) ),
inference(trivial_inequality_removal,[],[f87]) ).
fof(f87,plain,
( j(sK0(h(sK1))) != j(sK0(h(sK1)))
| ~ sorti1(j(sK0(h(sK1))))
| ~ sorti1(sK1) ),
inference(superposition,[],[f28,f82]) ).
fof(f82,plain,
! [X0] :
( j(sK0(h(X0))) = op1(X0,j(sK0(h(X0))))
| ~ sorti1(X0) ),
inference(subsumption_resolution,[],[f73,f19]) ).
fof(f73,plain,
! [X0] :
( j(sK0(h(X0))) = op1(X0,j(sK0(h(X0))))
| ~ sorti2(h(X0))
| ~ sorti1(X0) ),
inference(superposition,[],[f56,f24]) ).
fof(f24,plain,
! [X0] :
( j(h(X0)) = X0
| ~ sorti1(X0) ),
inference(cnf_transformation,[],[f14]) ).
fof(f56,plain,
! [X0] :
( j(sK0(X0)) = op1(j(X0),j(sK0(X0)))
| ~ sorti2(X0) ),
inference(subsumption_resolution,[],[f55,f25]) ).
fof(f55,plain,
! [X0] :
( j(sK0(X0)) = op1(j(X0),j(sK0(X0)))
| ~ sorti2(sK0(X0))
| ~ sorti2(X0) ),
inference(duplicate_literal_removal,[],[f52]) ).
fof(f52,plain,
! [X0] :
( j(sK0(X0)) = op1(j(X0),j(sK0(X0)))
| ~ sorti2(sK0(X0))
| ~ sorti2(X0)
| ~ sorti2(X0) ),
inference(superposition,[],[f22,f26]) ).
fof(f26,plain,
! [X0] :
( sK0(X0) = op2(X0,sK0(X0))
| ~ sorti2(X0) ),
inference(cnf_transformation,[],[f16]) ).
fof(f22,plain,
! [X2,X3] :
( j(op2(X2,X3)) = op1(j(X2),j(X3))
| ~ sorti2(X3)
| ~ sorti2(X2) ),
inference(cnf_transformation,[],[f14]) ).
fof(f28,plain,
! [X1] :
( op1(sK1,X1) != X1
| ~ sorti1(X1) ),
inference(cnf_transformation,[],[f18]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : ALG177+1 : TPTP v8.1.2. Released v2.7.0.
% 0.08/0.16 % 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.38 % Computer : n009.cluster.edu
% 0.14/0.38 % Model : x86_64 x86_64
% 0.14/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.38 % Memory : 8042.1875MB
% 0.14/0.38 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.38 % CPULimit : 300
% 0.14/0.38 % WCLimit : 300
% 0.14/0.38 % DateTime : Fri May 3 20:01:23 EDT 2024
% 0.14/0.38 % CPUTime :
% 0.14/0.38 This is a FOF_THM_RFO_SEQ problem
% 0.14/0.38 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.UGVVIQjgBR/Vampire---4.8_26689
% 0.54/0.75 % (26800)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.54/0.75 % (26799)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.54/0.75 % (26801)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.54/0.75 % (26802)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.54/0.75 % (26804)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.54/0.75 % (26797)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.54/0.75 % (26804)Refutation not found, incomplete strategy% (26804)------------------------------
% 0.54/0.75 % (26804)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.54/0.75 % (26804)Termination reason: Refutation not found, incomplete strategy
% 0.54/0.75
% 0.54/0.75 % (26804)Memory used [KB]: 969
% 0.54/0.75 % (26804)Time elapsed: 0.002 s
% 0.54/0.75 % (26804)Instructions burned: 2 (million)
% 0.54/0.75 % (26804)------------------------------
% 0.54/0.75 % (26804)------------------------------
% 0.54/0.75 % (26802)First to succeed.
% 0.54/0.75 % (26798)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.54/0.75 % (26803)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.54/0.75 % (26797)Refutation not found, incomplete strategy% (26797)------------------------------
% 0.54/0.75 % (26797)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.54/0.75 % (26797)Termination reason: Refutation not found, incomplete strategy
% 0.54/0.75
% 0.54/0.75 % (26797)Memory used [KB]: 970
% 0.54/0.75 % (26797)Time elapsed: 0.004 s
% 0.54/0.75 % (26797)Instructions burned: 3 (million)
% 0.54/0.75 % (26802)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-26796"
% 0.54/0.75 % (26797)------------------------------
% 0.54/0.75 % (26797)------------------------------
% 0.54/0.75 % (26800)Also succeeded, but the first one will report.
% 0.54/0.75 % (26802)Refutation found. Thanks to Tanya!
% 0.54/0.75 % SZS status Theorem for Vampire---4
% 0.54/0.75 % SZS output start Proof for Vampire---4
% See solution above
% 0.54/0.75 % (26802)------------------------------
% 0.54/0.75 % (26802)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.54/0.75 % (26802)Termination reason: Refutation
% 0.54/0.75
% 0.54/0.75 % (26802)Memory used [KB]: 1059
% 0.54/0.75 % (26802)Time elapsed: 0.005 s
% 0.54/0.75 % (26802)Instructions burned: 6 (million)
% 0.54/0.75 % (26796)Success in time 0.365 s
% 0.54/0.75 % Vampire---4.8 exiting
%------------------------------------------------------------------------------