TSTP Solution File: ALG173+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : ALG173+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:12:03 EDT 2024
% Result : Theorem 0.60s 0.75s
% Output : Refutation 0.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of formulae : 15 ( 5 unt; 0 def)
% Number of atoms : 227 ( 218 equ)
% Maximal formula atoms : 50 ( 15 avg)
% Number of connectives : 330 ( 118 ~; 20 |; 192 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 37 ( 13 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 5 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 0 ( 0 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f425,plain,
$false,
inference(subsumption_resolution,[],[f424,f78]) ).
fof(f78,plain,
e3 != e4,
inference(cnf_transformation,[],[f5]) ).
fof(f5,axiom,
( e3 != e4
& e2 != e4
& e2 != e3
& e1 != e4
& e1 != e3
& e1 != e2
& e0 != e4
& e0 != e3
& e0 != e2
& e0 != e1 ),
file('/export/starexec/sandbox/tmp/tmp.PxVt85C8mU/Vampire---4.8_10866',ax5) ).
fof(f424,plain,
e3 = e4,
inference(forward_demodulation,[],[f82,f62]) ).
fof(f62,plain,
e3 = op(e3,op(e3,e3)),
inference(cnf_transformation,[],[f14]) ).
fof(f14,plain,
( e4 = op(e4,op(e4,e4))
& e3 = op(e4,op(e4,e3))
& e2 = op(e4,op(e4,e2))
& e1 = op(e4,op(e4,e1))
& e0 = op(e4,op(e4,e0))
& e4 = op(e3,op(e3,e4))
& e3 = op(e3,op(e3,e3))
& e2 = op(e3,op(e3,e2))
& e1 = op(e3,op(e3,e1))
& e0 = op(e3,op(e3,e0))
& e4 = op(e2,op(e2,e4))
& e3 = op(e2,op(e2,e3))
& e2 = op(e2,op(e2,e2))
& e1 = op(e2,op(e2,e1))
& e0 = op(e2,op(e2,e0))
& e4 = op(e1,op(e1,e4))
& e3 = op(e1,op(e1,e3))
& e2 = op(e1,op(e1,e2))
& e1 = op(e1,op(e1,e1))
& e0 = op(e1,op(e1,e0))
& e4 = op(e0,op(e0,e4))
& e3 = op(e0,op(e0,e3))
& e2 = op(e0,op(e0,e2))
& e1 = op(e0,op(e0,e1))
& e0 = op(e0,op(e0,e0))
& ( ( e4 != op(e4,e4)
& e3 != op(e4,e3)
& e2 != op(e4,e2)
& e1 != op(e4,e1)
& e0 != op(e4,e0) )
| sP3
| sP2
| sP1
| sP0 ) ),
inference(definition_folding,[],[f9,f13,f12,f11,f10]) ).
fof(f10,plain,
( ( e4 != op(e0,e4)
& e3 != op(e0,e3)
& e2 != op(e0,e2)
& e1 != op(e0,e1)
& e0 != op(e0,e0) )
| ~ sP0 ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).
fof(f11,plain,
( ( e4 != op(e1,e4)
& e3 != op(e1,e3)
& e2 != op(e1,e2)
& e1 != op(e1,e1)
& e0 != op(e1,e0) )
| ~ sP1 ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP1])]) ).
fof(f12,plain,
( ( e4 != op(e2,e4)
& e3 != op(e2,e3)
& e2 != op(e2,e2)
& e1 != op(e2,e1)
& e0 != op(e2,e0) )
| ~ sP2 ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP2])]) ).
fof(f13,plain,
( ( e4 != op(e3,e4)
& e3 != op(e3,e3)
& e2 != op(e3,e2)
& e1 != op(e3,e1)
& e0 != op(e3,e0) )
| ~ sP3 ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP3])]) ).
fof(f9,plain,
( e4 = op(e4,op(e4,e4))
& e3 = op(e4,op(e4,e3))
& e2 = op(e4,op(e4,e2))
& e1 = op(e4,op(e4,e1))
& e0 = op(e4,op(e4,e0))
& e4 = op(e3,op(e3,e4))
& e3 = op(e3,op(e3,e3))
& e2 = op(e3,op(e3,e2))
& e1 = op(e3,op(e3,e1))
& e0 = op(e3,op(e3,e0))
& e4 = op(e2,op(e2,e4))
& e3 = op(e2,op(e2,e3))
& e2 = op(e2,op(e2,e2))
& e1 = op(e2,op(e2,e1))
& e0 = op(e2,op(e2,e0))
& e4 = op(e1,op(e1,e4))
& e3 = op(e1,op(e1,e3))
& e2 = op(e1,op(e1,e2))
& e1 = op(e1,op(e1,e1))
& e0 = op(e1,op(e1,e0))
& e4 = op(e0,op(e0,e4))
& e3 = op(e0,op(e0,e3))
& e2 = op(e0,op(e0,e2))
& e1 = op(e0,op(e0,e1))
& e0 = op(e0,op(e0,e0))
& ( ( e4 != op(e4,e4)
& e3 != op(e4,e3)
& e2 != op(e4,e2)
& e1 != op(e4,e1)
& e0 != op(e4,e0) )
| ( e4 != op(e3,e4)
& e3 != op(e3,e3)
& e2 != op(e3,e2)
& e1 != op(e3,e1)
& e0 != op(e3,e0) )
| ( e4 != op(e2,e4)
& e3 != op(e2,e3)
& e2 != op(e2,e2)
& e1 != op(e2,e1)
& e0 != op(e2,e0) )
| ( e4 != op(e1,e4)
& e3 != op(e1,e3)
& e2 != op(e1,e2)
& e1 != op(e1,e1)
& e0 != op(e1,e0) )
| ( e4 != op(e0,e4)
& e3 != op(e0,e3)
& e2 != op(e0,e2)
& e1 != op(e0,e1)
& e0 != op(e0,e0) ) ) ),
inference(flattening,[],[f8]) ).
fof(f8,negated_conjecture,
~ ~ ( e4 = op(e4,op(e4,e4))
& e3 = op(e4,op(e4,e3))
& e2 = op(e4,op(e4,e2))
& e1 = op(e4,op(e4,e1))
& e0 = op(e4,op(e4,e0))
& e4 = op(e3,op(e3,e4))
& e3 = op(e3,op(e3,e3))
& e2 = op(e3,op(e3,e2))
& e1 = op(e3,op(e3,e1))
& e0 = op(e3,op(e3,e0))
& e4 = op(e2,op(e2,e4))
& e3 = op(e2,op(e2,e3))
& e2 = op(e2,op(e2,e2))
& e1 = op(e2,op(e2,e1))
& e0 = op(e2,op(e2,e0))
& e4 = op(e1,op(e1,e4))
& e3 = op(e1,op(e1,e3))
& e2 = op(e1,op(e1,e2))
& e1 = op(e1,op(e1,e1))
& e0 = op(e1,op(e1,e0))
& e4 = op(e0,op(e0,e4))
& e3 = op(e0,op(e0,e3))
& e2 = op(e0,op(e0,e2))
& e1 = op(e0,op(e0,e1))
& e0 = op(e0,op(e0,e0))
& ( ( e4 != op(e4,e4)
& e3 != op(e4,e3)
& e2 != op(e4,e2)
& e1 != op(e4,e1)
& e0 != op(e4,e0) )
| ( e4 != op(e3,e4)
& e3 != op(e3,e3)
& e2 != op(e3,e2)
& e1 != op(e3,e1)
& e0 != op(e3,e0) )
| ( e4 != op(e2,e4)
& e3 != op(e2,e3)
& e2 != op(e2,e2)
& e1 != op(e2,e1)
& e0 != op(e2,e0) )
| ( e4 != op(e1,e4)
& e3 != op(e1,e3)
& e2 != op(e1,e2)
& e1 != op(e1,e1)
& e0 != op(e1,e0) )
| ( e4 != op(e0,e4)
& e3 != op(e0,e3)
& e2 != op(e0,e2)
& e1 != op(e0,e1)
& e0 != op(e0,e0) ) ) ),
inference(negated_conjecture,[],[f7]) ).
fof(f7,conjecture,
~ ( e4 = op(e4,op(e4,e4))
& e3 = op(e4,op(e4,e3))
& e2 = op(e4,op(e4,e2))
& e1 = op(e4,op(e4,e1))
& e0 = op(e4,op(e4,e0))
& e4 = op(e3,op(e3,e4))
& e3 = op(e3,op(e3,e3))
& e2 = op(e3,op(e3,e2))
& e1 = op(e3,op(e3,e1))
& e0 = op(e3,op(e3,e0))
& e4 = op(e2,op(e2,e4))
& e3 = op(e2,op(e2,e3))
& e2 = op(e2,op(e2,e2))
& e1 = op(e2,op(e2,e1))
& e0 = op(e2,op(e2,e0))
& e4 = op(e1,op(e1,e4))
& e3 = op(e1,op(e1,e3))
& e2 = op(e1,op(e1,e2))
& e1 = op(e1,op(e1,e1))
& e0 = op(e1,op(e1,e0))
& e4 = op(e0,op(e0,e4))
& e3 = op(e0,op(e0,e3))
& e2 = op(e0,op(e0,e2))
& e1 = op(e0,op(e0,e1))
& e0 = op(e0,op(e0,e0))
& ( ( e4 != op(e4,e4)
& e3 != op(e4,e3)
& e2 != op(e4,e2)
& e1 != op(e4,e1)
& e0 != op(e4,e0) )
| ( e4 != op(e3,e4)
& e3 != op(e3,e3)
& e2 != op(e3,e2)
& e1 != op(e3,e1)
& e0 != op(e3,e0) )
| ( e4 != op(e2,e4)
& e3 != op(e2,e3)
& e2 != op(e2,e2)
& e1 != op(e2,e1)
& e0 != op(e2,e0) )
| ( e4 != op(e1,e4)
& e3 != op(e1,e3)
& e2 != op(e1,e2)
& e1 != op(e1,e1)
& e0 != op(e1,e0) )
| ( e4 != op(e0,e4)
& e3 != op(e0,e3)
& e2 != op(e0,e2)
& e1 != op(e0,e1)
& e0 != op(e0,e0) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.PxVt85C8mU/Vampire---4.8_10866',co1) ).
fof(f82,plain,
e4 = op(e3,op(e3,e3)),
inference(cnf_transformation,[],[f6]) ).
fof(f6,axiom,
( e4 = op(e3,op(e3,e3))
& e2 = op(e3,e3)
& e1 = op(e3,op(e3,op(e3,e3)))
& e0 = op(op(e3,op(e3,e3)),op(e3,op(e3,e3))) ),
file('/export/starexec/sandbox/tmp/tmp.PxVt85C8mU/Vampire---4.8_10866',ax6) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : ALG173+1 : TPTP v8.1.2. Released v2.7.0.
% 0.12/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.16/0.36 % Computer : n009.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37 % CPULimit : 300
% 0.16/0.37 % WCLimit : 300
% 0.16/0.37 % DateTime : Fri May 3 19:56:53 EDT 2024
% 0.16/0.37 % CPUTime :
% 0.16/0.37 This is a FOF_THM_RFO_PEQ problem
% 0.16/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.PxVt85C8mU/Vampire---4.8_10866
% 0.55/0.75 % (11126)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.55/0.75 % (11128)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.55/0.75 % (11129)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.55/0.75 % (11127)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.55/0.75 % (11131)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.55/0.75 % (11130)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.55/0.75 % (11132)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.55/0.75 % (11133)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.55/0.75 % (11129)First to succeed.
% 0.60/0.75 % (11128)Also succeeded, but the first one will report.
% 0.60/0.75 % (11129)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-11112"
% 0.60/0.75 % (11129)Refutation found. Thanks to Tanya!
% 0.60/0.75 % SZS status Theorem for Vampire---4
% 0.60/0.75 % SZS output start Proof for Vampire---4
% See solution above
% 0.60/0.75 % (11129)------------------------------
% 0.60/0.75 % (11129)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.75 % (11129)Termination reason: Refutation
% 0.60/0.75
% 0.60/0.75 % (11129)Memory used [KB]: 1148
% 0.60/0.75 % (11129)Time elapsed: 0.007 s
% 0.60/0.75 % (11129)Instructions burned: 11 (million)
% 0.60/0.75 % (11112)Success in time 0.379 s
% 0.60/0.75 % Vampire---4.8 exiting
%------------------------------------------------------------------------------