TSTP Solution File: ALG041+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : ALG041+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/sandbox/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:10:39 EDT 2024
% Result : Theorem 0.57s 0.76s
% Output : Refutation 0.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 8
% Syntax : Number of formulae : 44 ( 5 unt; 0 def)
% Number of atoms : 179 ( 45 equ)
% Maximal formula atoms : 14 ( 4 avg)
% Number of connectives : 215 ( 80 ~; 61 |; 38 &)
% ( 2 <=>; 34 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 3 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 1 con; 0-2 aty)
% Number of variables : 90 ( 83 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f134,plain,
$false,
inference(avatar_sat_refutation,[],[f87,f121,f133]) ).
fof(f133,plain,
~ spl2_1,
inference(avatar_contradiction_clause,[],[f127]) ).
fof(f127,plain,
( $false
| ~ spl2_1 ),
inference(resolution,[],[f82,f26]) ).
fof(f26,plain,
sorti2(sK0),
inference(cnf_transformation,[],[f17]) ).
fof(f17,plain,
( ! [X1] :
( op2(X1,X1) = sK0
| ~ sorti2(X1) )
& sorti2(sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f11,f16]) ).
fof(f16,plain,
( ? [X0] :
( ! [X1] :
( op2(X1,X1) = X0
| ~ sorti2(X1) )
& sorti2(X0) )
=> ( ! [X1] :
( op2(X1,X1) = sK0
| ~ sorti2(X1) )
& sorti2(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f11,plain,
? [X0] :
( ! [X1] :
( op2(X1,X1) = X0
| ~ sorti2(X1) )
& sorti2(X0) ),
inference(ennf_transformation,[],[f8]) ).
fof(f8,plain,
? [X0] :
( ! [X1] :
( sorti2(X1)
=> op2(X1,X1) = X0 )
& sorti2(X0) ),
inference(flattening,[],[f4]) ).
fof(f4,axiom,
~ ~ ? [X0] :
( ! [X1] :
( sorti2(X1)
=> op2(X1,X1) = X0 )
& sorti2(X0) ),
file('/export/starexec/sandbox/tmp/tmp.MQuuMJ4mZv/Vampire---4.8_22613',ax4) ).
fof(f82,plain,
( ! [X0] : ~ sorti2(X0)
| ~ spl2_1 ),
inference(avatar_component_clause,[],[f81]) ).
fof(f81,plain,
( spl2_1
<=> ! [X0] : ~ sorti2(X0) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_1])]) ).
fof(f121,plain,
~ spl2_2,
inference(avatar_split_clause,[],[f118,f84]) ).
fof(f84,plain,
( spl2_2
<=> sorti1(j(sK0)) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_2])]) ).
fof(f118,plain,
~ sorti1(j(sK0)),
inference(equality_resolution,[],[f111]) ).
fof(f111,plain,
! [X0] :
( j(sK0) != X0
| ~ sorti1(X0) ),
inference(subsumption_resolution,[],[f104,f28]) ).
fof(f28,plain,
! [X0] :
( sorti1(sK1(X0))
| ~ sorti1(X0) ),
inference(cnf_transformation,[],[f19]) ).
fof(f19,plain,
! [X0] :
( ( op1(sK1(X0),sK1(X0)) != X0
& sorti1(sK1(X0)) )
| ~ sorti1(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f12,f18]) ).
fof(f18,plain,
! [X0] :
( ? [X1] :
( op1(X1,X1) != X0
& sorti1(X1) )
=> ( op1(sK1(X0),sK1(X0)) != X0
& sorti1(sK1(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f12,plain,
! [X0] :
( ? [X1] :
( op1(X1,X1) != X0
& sorti1(X1) )
| ~ sorti1(X0) ),
inference(ennf_transformation,[],[f3]) ).
fof(f3,axiom,
~ ? [X0] :
( ! [X1] :
( sorti1(X1)
=> op1(X1,X1) = X0 )
& sorti1(X0) ),
file('/export/starexec/sandbox/tmp/tmp.MQuuMJ4mZv/Vampire---4.8_22613',ax3) ).
fof(f104,plain,
! [X0] :
( j(sK0) != X0
| ~ sorti1(X0)
| ~ sorti1(sK1(X0)) ),
inference(superposition,[],[f29,f75]) ).
fof(f75,plain,
! [X0] :
( j(sK0) = op1(X0,X0)
| ~ sorti1(X0) ),
inference(subsumption_resolution,[],[f64,f20]) ).
fof(f20,plain,
! [X7] :
( sorti2(h(X7))
| ~ sorti1(X7) ),
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,[],[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(flattening,[],[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(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/tmp/tmp.MQuuMJ4mZv/Vampire---4.8_22613',co1) ).
fof(f64,plain,
! [X0] :
( j(sK0) = op1(X0,X0)
| ~ sorti2(h(X0))
| ~ sorti1(X0) ),
inference(superposition,[],[f61,f25]) ).
fof(f25,plain,
! [X0] :
( j(h(X0)) = X0
| ~ sorti1(X0) ),
inference(cnf_transformation,[],[f15]) ).
fof(f61,plain,
! [X0] :
( op1(j(X0),j(X0)) = j(sK0)
| ~ sorti2(X0) ),
inference(duplicate_literal_removal,[],[f58]) ).
fof(f58,plain,
! [X0] :
( op1(j(X0),j(X0)) = j(sK0)
| ~ sorti2(X0)
| ~ sorti2(X0)
| ~ sorti2(X0) ),
inference(superposition,[],[f23,f27]) ).
fof(f27,plain,
! [X1] :
( op2(X1,X1) = sK0
| ~ sorti2(X1) ),
inference(cnf_transformation,[],[f17]) ).
fof(f23,plain,
! [X2,X3] :
( j(op2(X2,X3)) = op1(j(X2),j(X3))
| ~ sorti2(X3)
| ~ sorti2(X2) ),
inference(cnf_transformation,[],[f15]) ).
fof(f29,plain,
! [X0] :
( op1(sK1(X0),sK1(X0)) != X0
| ~ sorti1(X0) ),
inference(cnf_transformation,[],[f19]) ).
fof(f87,plain,
( spl2_1
| spl2_2 ),
inference(avatar_split_clause,[],[f79,f84,f81]) ).
fof(f79,plain,
! [X0] :
( sorti1(j(sK0))
| ~ sorti2(X0) ),
inference(subsumption_resolution,[],[f73,f21]) ).
fof(f21,plain,
! [X6] :
( sorti1(j(X6))
| ~ sorti2(X6) ),
inference(cnf_transformation,[],[f15]) ).
fof(f73,plain,
! [X0] :
( sorti1(j(sK0))
| ~ sorti1(j(X0))
| ~ sorti2(X0) ),
inference(duplicate_literal_removal,[],[f70]) ).
fof(f70,plain,
! [X0] :
( sorti1(j(sK0))
| ~ sorti1(j(X0))
| ~ sorti1(j(X0))
| ~ sorti2(X0) ),
inference(superposition,[],[f30,f61]) ).
fof(f30,plain,
! [X0,X1] :
( sorti1(op1(X0,X1))
| ~ sorti1(X1)
| ~ sorti1(X0) ),
inference(cnf_transformation,[],[f13]) ).
fof(f13,plain,
! [X0] :
( ! [X1] :
( sorti1(op1(X0,X1))
| ~ sorti1(X1) )
| ~ sorti1(X0) ),
inference(ennf_transformation,[],[f1]) ).
fof(f1,axiom,
! [X0] :
( sorti1(X0)
=> ! [X1] :
( sorti1(X1)
=> sorti1(op1(X0,X1)) ) ),
file('/export/starexec/sandbox/tmp/tmp.MQuuMJ4mZv/Vampire---4.8_22613',ax1) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : ALG041+1 : TPTP v8.1.2. Released v2.7.0.
% 0.07/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 : n009.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.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Fri May 3 20:00:23 EDT 2024
% 0.15/0.37 % CPUTime :
% 0.15/0.37 This is a FOF_THM_RFO_SEQ 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.MQuuMJ4mZv/Vampire---4.8_22613
% 0.57/0.75 % (22872)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.57/0.75 % (22871)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.57/0.75 % (22872)Refutation not found, incomplete strategy% (22872)------------------------------
% 0.57/0.75 % (22872)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.57/0.75 % (22865)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.57/0.75 % (22872)Termination reason: Refutation not found, incomplete strategy
% 0.57/0.75
% 0.57/0.75 % (22872)Memory used [KB]: 969
% 0.57/0.75 % (22867)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.57/0.75 % (22872)Time elapsed: 0.002 s
% 0.57/0.75 % (22872)Instructions burned: 2 (million)
% 0.57/0.75 % (22868)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.57/0.75 % (22866)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.57/0.75 % (22869)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.57/0.75 % (22870)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.57/0.75 % (22872)------------------------------
% 0.57/0.75 % (22872)------------------------------
% 0.57/0.76 % (22865)Refutation not found, incomplete strategy% (22865)------------------------------
% 0.57/0.76 % (22865)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.57/0.76 % (22865)Termination reason: Refutation not found, incomplete strategy
% 0.57/0.76
% 0.57/0.76 % (22865)Memory used [KB]: 971
% 0.57/0.76 % (22865)Time elapsed: 0.003 s
% 0.57/0.76 % (22865)Instructions burned: 3 (million)
% 0.57/0.76 % (22865)------------------------------
% 0.57/0.76 % (22865)------------------------------
% 0.57/0.76 % (22870)First to succeed.
% 0.57/0.76 % (22874)dis+3_25:4_sil=16000:sos=all:erd=off:i=50:s2at=4.0:bd=off:nm=60:sup=off:cond=on:av=off:ins=2:nwc=10.0:etr=on:to=lpo:s2agt=20:fd=off:bsr=unit_only:slsq=on:slsqr=28,19:awrs=converge:awrsf=500:tgt=ground:bs=unit_only_0 on Vampire---4 for (2996ds/50Mi)
% 0.57/0.76 % (22870)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-22861"
% 0.57/0.76 % (22868)Also succeeded, but the first one will report.
% 0.57/0.76 % (22870)Refutation found. Thanks to Tanya!
% 0.57/0.76 % SZS status Theorem for Vampire---4
% 0.57/0.76 % SZS output start Proof for Vampire---4
% See solution above
% 0.57/0.76 % (22870)------------------------------
% 0.57/0.76 % (22870)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.57/0.76 % (22870)Termination reason: Refutation
% 0.57/0.76
% 0.57/0.76 % (22870)Memory used [KB]: 1069
% 0.57/0.76 % (22870)Time elapsed: 0.006 s
% 0.57/0.76 % (22870)Instructions burned: 7 (million)
% 0.57/0.76 % (22861)Success in time 0.386 s
% 0.57/0.76 % Vampire---4.8 exiting
%------------------------------------------------------------------------------